Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElectronic Notes in Discrete Mathematics, Volume 5
Volume 5, July 2000
- Irena Rusu:
Preface: Volume 5. 1-2 - Méziane Aïder
, Sylvain Gravier:
Critical graphs for clique-coloring. 3-6 - Kiyoshi Ando:
Contractible edges in a k-connected graph (K1 + P4)-free graph. 7-10 - Krystyna T. Balinska, Louis V. Quintas:
Results and Problems Concerning Edge Transformed Graphs. 11-14 - Jørgen Bang-Jensen:
Problems concerning global connectivity of directed graphs. 15-18 - Fatiha Bendali, Ali Ridha Mahjoub, Jean Mailfert:
Composition of graphs and the triangle free subgraph polytope. 19-22 - Halina Bielak:
Local Ramsey Numbers for Copies of Cycles. 23-26 - Hans L. Bodlaender:
The algorithmic theory of treewidth. 27-30 - Anthony Bonato, Kathie Cameron:
On 2-e.c. graphs, tournaments, and hypergraphs. 31-34 - Nicolas Bonichon, Bertrand Le Saëc, Mohamed Mosbah:
Orthogonal Drawings Based On The Stratification Of Planar Graphs. 35-37 - Gabriela Hauser Bordalo, Bernard Monjardet:
The lattice of strict completions of a poset. 38-41 - Bostjan Bresar:
On subgraphs of Cartesian product graphs and S-primeness. 42-45 - Richard C. Brewster, Pavol Hell:
On homomorphisms to edge-coloured cycles. 46-49 - Kathie Cameron:
Induced Matchings in Intersection Graphs. 50-52 - Roberto Canogar:
Partition Designs with two subsets of the Hamming Space. 53-55 - Nathalie Caspard, Claude Le Conte de Poly-Barbut, Roberto Mantaci, Michel Morvan:
Cayley lattices of finite Coxeter groups are bounded. 56-59 - Irène Charon, Olivier Hudry:
Slater orders and Hamiltonian paths of tournaments. 60-63 - Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt:
On i-minus-Edge-Removal-critical graphs. 64-66 - Gérard D. Cohen, Sylvia B. Encheva, Gilles Zémor:
A hypergraph approach to digital fingerprinting. 67-70 - Ricardo C. Corrêa, Jayme Luiz Szwarcfiter:
On Extensions, Linear Extensions, Upsets and Downsets of Ordered Sets (Extended Abstract). 71-74 - Bruno Courcelle:
Clique-width of countable graphs: a compactness property. 75-76 - Henry Crapo, Claude Le Conte de Poly-Barbut:
Coxeter groups through the looking glass: Mirrors and Convexity. 77-80 - Rita Csákány:
Some Results on the Sandglass Conjecture. 81-84 - Peter Dankelmann, Dieter Rautenbach, Lutz Volkmann:
Some results on graph parameters in weighted graphs. 85-88 - Celina M. H. de Figueiredo, Sulamita Klein, Kristina Vuskovic:
The graph sandwich problem for 1-join composition is NP-complete. 89-92 - Charles Delorme:
Laplacian Eigenvalues and multisections. 93-96 - Dominique de Werra:
Variations on the theorem of Birkhoff-von Neumann and extensions. 97-99 - Vladimir Dobrynin:
On rank of a matrix associated with graph. 100-103 - Damanpal Singh Dogra, Dominique Fortin:
Simultaneous Disjoint Routing in Regular Graphs. 104-107 - Reinhardt Euler:
Coloring Planar Toeplitz Graphs. 108-111 - Guillaume Fertin, André Raspaud:
Recognizing Recursive Circulant Graphs (Extended Abstract). 112-115 - Gasper Fijavz:
K6 and icosahedron minors in 5-connected projective planar graphs. 116-119 - Art S. Finbow, Bert L. Hartnell:
Well-located graphs: A collection of well-covered ones. 120-122 - Miranca Fischermann, Lutz Volkmann:
Graphs with unique dominating sets. 123-125 - András Frank:
Edge-Connectivities of Graphs and Digraphs. 126-129 - Peter Frankl, Gyula Y. Katona:
Extremal k-edge-hamiltonian Hypergraphs. 130-133 - Cyril Gavoille, Christophe Paul:
Approximate Distance Labeling Schemes. 134-137 - Vassilis Giakoumakis, Jean-Marie Vanherpe:
Linear time recognition of Weak bisplit graphs. 138-141 - Izolda Gorgol:
Some medications of Ramsey numbers. 142-144 - Harald Gropp:
"Réseaux réguliers" or regular graphs. 145-148 - Bertrand Guenin:
A Characterization of Weakly Bipartite Graphs. 149-151 - Alain Guénoche, Bruno Leclerc, Vladimir Makarenkov:
Generalized trees related with tree metrics. 152-154 - Glen-Brug Guenver, Jean-Xavier Rampon:
Split Orders. 155-157 - Pierre Hansen, Gilles Caporossi:
AutoGraphiX: An Automated System for Finding Conjectures in Graph Theory. 158-161 - Christophe Haro, Patrick Martineau, Christian Proust:
Digraph representation by its path matrix The particular case of the bipartite graphs. 162-165 - Frédéric Havet:
Trees in tournaments. 166-169 - Pavol Hell:
Graph Packings. 170-173 - Francine Herrmann, Alain Hertz:
Finding the chromatic number by means of critical graphs. 174-176 - Marie-Claude Heydemann, Nausica Marlin, Stéphane Pérennes:
Rotational Cayley Graphs on Transposition Generated Groups. 177-180 - Arne Hoffmann:
Regular factors in regular multipartite graphs. 181-184 - Bill Jackson, Tibor Jordán:
Connectivity Augmentation of Graphs. 185-188 - Stanislav Jendrol', Heinz-Jürgen Voss:
Light subgraphs of multigraphs embedded in compact 2-manifolds. 189-192 - Petra Johann:
On the structure of graphs with a unique k-factor. 193-195 - Vladislav V. Kabanov, Igor Vakula:
The lower domination parameters in inflated graphs. 196-197 - Atsushi Kaneko, Kiyoshi Yoshimoto:
A 4-cycle and a 2-factor with two components of a graph satisfying the Chvátal-Erdös condition. 198-200 - Ken-ichi Kawarabayashi:
Relative Length of Longest Path and Longest Cycle. 201 - Hamamache Kheddouci:
Partially Square Graphs, Hamiltonicity and Circumference II. 202-205 - Felix Lazebnik, Andrew J. Woldar:
General Properties of Some Graphs Defined by Systems of Equations. 206-209 - Ali Ridha Mahjoub, Pierre Pesneau:
On Steiner 2-edge connected polytopes. 210-213 - Federico Malucelli, Sara Nicoloso:
Shiftable Intervals. 214-217 - Antoni Marczyk:
On pancyclism of hamiltonian graphs. 218-221 - Jana Maxová, Jaroslav Nesetril:
On covers of graphs. 222-224 - Sean McGuinness:
Contractible bonds in Graphs. 225-227 - Brendan D. McKay, Ian M. Wanless, Nicholas C. Wormald:
The asymptotic number of graphs with a restriction on the maximum degree. 228-230 - Bojan Mohar:
Some Topological Methods in Graph Coloring Theory. 231-234 - Michael Molloy, Bruce A. Reed:
k-Colouring when k is close to Delta. 235-238 - Juan José Montellano-Ballesteros, Victor Neumann-Lara:
Totally Multicoloured Cycles. 239-242 - Wendy J. Myrvold, Jianping Roth:
Simpler Projective Plane Embedding. 243-246 - Michael Naatz:
A Connectivity Lemma. 247-250 - Viet Hung Nguyen, Jean François Maurras:
A procedure of facet composition for the symmetric Traveling Salesman Polytope. 251-252 - Patrice Ossona de Mendez, Pierre Rosenstiehl:
Coding Properties of Breadth-First Search Orderings. 253-255 - Arnaud Pâcher:
Cayley partitionable graphs. 256-259 - Oleg Pikhurko:
Size Ramsey Numbers Involving Large Stars. 260-262 - Norbert Radics:
Rigidity of multi-story buildings. 263-265 - Vijay Raghavan, Jeremy P. Spinrad:
Solving Problems on Special Classes of Graphs. 266-269 - Bert Randerath:
3-Colourability and Forbidden Subgraphs. 270-273 - András Recski:
VLSI Routing in Polynomial Time. 274-277 - Gábor Simonyi:
Perfection, Imperfection, and Graph Entropy. 278-280 - Petra Smolíková:
The Simple Chromatic Number of Oriented Graphs. 281-283 - László A. Székely:
A successful concept for measuring non-planarity of graphs: the crossing number. 284-287 - Dávid Szeszlér:
Hamilton Cycles and Degree Sequences. 288-290 - Zoltán Szigeti:
On min-max theorems in matching theory. 291-294 - Andrew Thomason:
Subdivisions, linking, minors, and extremal functions. 295-298 - Morimasa Tsuchiya, Kenjiro Ogawa, Shin-ichi Iwai:
On construction of bound graphs. 299-302 - Jean-Marie Vanherpe:
Clique width of Partner limited graphs. 303-306 - A. Pawel Wojda, Mariusz Wozniak, Irmina A. Ziolo:
On self-complementary supergraphs of (n, n)-graphs. 307-310 - Mariusz Wozniak:
Packing of graphs and permutations. 311-314 - Kiyoshi Yoshimoto:
Hamiltonian cycles of certain kinds of graphs satisfying Dirac condition. 315-316 - Heping Zhang, Fuji Zhang:
Total Z-transformation graphs of perfect matching of plane bipartite graphs. 317-320 - Sònia P. Mansilla, Oriol Serra:
Exactly k-arc Transitive Covers. 321
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-05-13 20:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
