default search action
Electronic Notes in Discrete Mathematics, Volume 28
Volume 28, March 2007
- Petr Hlinený
, Jan Kratochvíl
Preface. 1 - Anna de Mier:
k-noncrossing and k-nonnesting graphs and fillings of Ferrers diagrams. 3-10 - P. V. Skums, S. V. Suzdal, R. I. Tyshkevich:
Operator Decomposition of Graphs and the Reconstruction Conjecture. 11-16 - Tatiana Panyukova
Eulerian Cover with Ordered Enclosing for Flat Graphs. 17-24 - Vsevolod F. Lev:
Sums and differences along Hamiltonian cycles. 25-31 - Attila Pór, David R. Wood
Colourings of the Cartesian Product of Graphs and Multiplicative Sidon Sets. 33-40 - Tobias Friedrich
Unbiased Matrix Rounding. 41-46 - Stéphane Bessy, Nicolas Lichiardopol, Jean-Sébastien Sereni:
Two proofs of Bermond-Thomassen conjecture for regular tournaments. 47-53 - Hajo Broersma
Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks. 55-59 - F. Aguiló-Gost, Alicia Miralles, Marisa Zaragozá:
Some contributions to the Frobenius' Problem. 61-68 - Annabell Berger, Winfried Hochstättler:
Minconvex graph factors of prescribed size and a simpler reduction to weighted f-factors. 69-76 - Jirí Fiala, José A. Soto:
Block transitivity and degree matrices: (Extended abstract). 77-82 - Zsolt Tuza:
Extremal jumps of the Hall number. 83-89 - Klaus Dohmen
Improved Bonferroni Inequalities and Binomially Bounded Functions. 91-93 - Miguel Angel Fiol
The Local Spectra of Line Graphs. 95-102 - Martin Kochol, Nad'a Krivonáková, Silvia Smejová, Katarína Sranková:
Nowhere-zero I-flows on wheels. 103-107 - Peter J. Cameron
The complexity of the Weight Problem for permutation groups. 109-116 - Norihide Tokushige
An extension of the Erdös-Ko-Rado Theorem. 117-123 - Stanislav Jendrol'
Rainbowness of plane graphs. 125-129 - John R. Schmitt, Michael Ferrara:
An Erdös-Stone Type Conjecture for Graphic Sequences. 131-135 - Gabriela Araujo-Pardo
On upper bounds and connectivity of cages. 137-140 - Gabriela Araujo-Pardo
Infinite families of (n+1)-dichromatic vertex critical circulant tournaments. 141-144 - Peter Jacko
Time-Constrained Restless Bandits and the Knapsack Problem for Perishable Items (Extended Abstract). 145-152 - Nicolas Bonichon, Cyril Gavoille, Arnaud Labourel:
Short Labels by Traversal and Jumping. 153-160 - Lubomir Torok
Antibandwidth of Three-Dimensional Meshes. 161-167 - Drago Bokal, Éva Czabarka
Graph minors and the crossing number of graphs. 169-175 - Markus Chimani, Carsten Gutwenger, Petra Mutzel
On the Minimum Cut of Planarizations. 177-184 - Arnaud Pêcher, Pierre Pesneau, Annegret Wagler:
On facets of stable set polytopes of claw-free graphs with stability number three. 185-190 - Jacob Fox, Veselin Jungic, Rados Radoicic:
Sub-Ramsey Numbers for Arithmetic Progressions and Schur Triples. 191-198 - Enrique Bendito, Ángeles Carmona, Andrés M. Encinas, José Manuel Gesto:
Regular two-point boundary value problems for the Schrödinger operator on a path. 199-206 - Alexander D. Mednykh
Enumeration of unrooted hypermaps. 207-214 - Dieter Mitsche:
Between Colorings and Layouts - Minimum Morphism Cost Problems. 215-221 - Jaroslav Nesetril
Fraternal Augmentations of graphs, Coloration and Minors. 223-230 - Luis Boza, M. P. Revuelta
The dimension of a graph. 231-238 - Eckhard Steffen
Tutte's 5-flow conjecture for highly cyclically connected cubic graphs. 239-242 - Ludovít Niepel:
Histories in Path Graphs. 243-250 - Louis Esperet
Acyclic improper choosability of graphs. 251-258 - I. M. Shitova:
On the chromatic numbers of metric spaces with few forbidden distances. 259-264 - Paul S. Bonsma:
Linear time algorithms for finding sparsest cuts in various graph classes. 265-272 - Andrei M. Raigorodskii:
Borsuk's problem and the chromatic numbers of metric spaces. 273-280 - Stanislav Jendrol'
Total Edge Irregularity Strength of Complete Graphs and Complete Bipartite Graphs. 281-285 - Frantisek Kardos:
Fulleroids with Dihedral Symmetry. 287-292 - Tomás Kaiser
Non-intersecting perfect matchings in cubic graphs (Extended abstract). 293-299 - Lubica Staneková:
t-Balanced Cayley maps of dihedral groups. 301-307 - Eva Milková
The Minimum Spanning Tree Problem: Jarník's solution in historical and present context. 309-316 - Tínaz Ekim, Nadimpalli V. R. Mahadev, Dominique de Werra:
Polar cographs. 317-323 - Peter Katrenic, Gabriel Semanisin
On a tree-partition problem. 325-330 - Ján Karabás
Archimedean solids of genus two. 331-339 - Yury L. Orlovich, Igor E. Zverovich:
Independent Domination in Triangle Graphs. 341-348 - Marián Klesc:
The Join of Graphs and Crossing Numbers. 349-355 - Yulia Kempner
A Geometric Characterization of Poly-antimatroids. 357-364 - Jana Siagiová, Tomás Vetrík
Large vertex-transitive and Cayley graphs with given degree and diameter. 365-369 - Tomás Feder, Pavol Hell, Wing Xie:
Matrix Partitions with Finitely Many Obstructions. 371-378 - Yevgeniya Kochubinska
On cross-sections of partial wreath product of inverse semigroups. 379-386 - Matej Stehlík:
A hypergraph version of the Gallai-Edmonds Theorem. 387-391 - Isidoro Gitler, Enrique Reyes, Rafael H. Villarreal
Ring graphs and toric ideals. 393-400 - Hortensia Galeana-Sánchez, Mucuy-kak Guevara
Kernel perfect and critical kernel imperfect digraphs structure. 401-408 - Moshe Rosenfeld:
A "simple" rectangular puzzle. 409-415 - Zdzislaw Skupien:
Exponentially many hypohamiltonian snarks. 417-424 - Benjamin Doerr, Johannes Lengler
The Interval Liar Game. 425-432 - Roman Cada
Path factors and line graphs. 433-436 - Oriol Serra
Some Ramsey and anti-Ramsey results in finite groups. 437-444 - Daniel Berend
A Reduction of the Anticoloring Problem to Connected Graphs. 445-451 - Sebastian Czerwinski, Jaroslaw Grytczuk
Nonrepetitive colorings of graphs. 453-459 - Ricardo Strausz:
Homomorphisms of separoids. 461-468 - André A. Keller:
Graph Theory and Economic Models: from Small to Large Size Applications. 469-476 - Martin Macaj, Jozef Sirán, Mária Ipolyiová:
Planar width of regular maps. 477-484 - Dávid Pál, Martin Skoviera:
Edge-Colourings of Cubic Graphs and Universal Steiner Triple Systems. 485-492 - Mihyun Kang
Evolution of random graph processes with degree constraints. 493-500 - Jérémie Chalopin, Pascal Ochem:
Dejean's conjecture and letter frequency. 501-505 - André Raspaud, Nicolas Roussel:
Circular chromatic number of triangle free graphs with given maximum average degree, extended abstract. 507-514 - Aleksandra Tepeh Horvat:
Crossing graphs of fiber-complemented graphs. 515-520 - Tadeja Kraner Sumenjak:
Theta-graphs of partial cubes and strong edge colorings. 521-526 - Sanming Zhou
Distance Labelling Problems for Hypercubes and Hamming Graphs - A Survey. 527-534 - Eugenia O'Reilly Regueiro
Classification of flag-transitive symmetric designs. 535-542 - Daniel Gonçalves:
On Vertex Partitions and the Colin de Verdière Parameter. 543-547 - Daniel Král
Distance Constrained Labelings of K4-minor Free Graphs. 549-556 - Shalom Eliahou
Some extensions of the Cauchy-Davenport theorem. 557-564
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 2025-02-12 00:07 CET 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: