Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 46
Volume 46, Number 1, May 2004
- András Gyárfás, Tommy Jensen, Michael Stiebitz:
On graphs with strongly independent color-classes. 1-14
- Mike J. Grannell, Terry S. Griggs, Martin Knor, Martin Skoviera:
A Steiner triple system which colors all cubic graphs. 15-24 - Tomás Kaiser
, Riste Skrekovski:
Planar graph colorings without short monochromatic cycles. 25-38 - János Pach, Géza Tóth:
Monotone drawings of planar graphs. 39-47 - Gregory Z. Gutin, Khee Meng Koh, Eng Guan Tay, Anders Yeo:
On the number of quasi-kernels in digraphs. 48-56 - Zhishi Pan, Xuding Zhu:
Density of the circular chromatic numbers of series-parallel graphs. 57-68 - Charles L. Dunn, Hal A. Kierstead:
The relaxed game chromatic number of outerplanar graphs. 69-78 - Jingzhong Mao, Lingli Sun:
Erratum to: The structure of geodetic blocks with diameter two. 79-80
Volume 46, Number 2, June 2004
- Yue Zhao:
New lower bounds for the size of edge chromatic critical graphs. 81-92 - Bianca Spille, László Szegö:
A Gallai-Edmonds-type structure theorem for path-matchings. 93-102 - Andrey A. Dobrynin, Leonid S. Melnikov, Artem V. Pyatkin:
Regular 4-critical graphs of even degree. 103-130 - Béla Bollobás, Alex D. Scott:
Judicious partitions of bounded-degree graphs. 131-143 - Douglas Bauer, T. Niessen, Edward F. Schmeichel:
Toughness, minimum degree, and spanning cubic subgraphs. 144
Volume 46, Number 3, July 2004
- Guantao Chen, Hikoe Enomoto, Ken-ichi Kawarabayashi, Katsuhiro Ota, Dingjun Lou, Akira Saito:
Vertex-disjoint cycles containing specified vertices in a bipartite graph. 145-166 - Yuri V. Matiyasevich:
Some probabilistic restatements of the Four Color Conjecture. 167-179 - Tao Jiang:
A note on a conjecture about cycles with many incident chords. 180-182 - Petr Hlinený, Robin Thomas:
On possible counterexamples to Negami's planar cover conjecture. 183-206 - Dan Archdeacon, Joanna A. Ellis-Monaghan, David C. Fisher, Dalibor Froncek, Peter Che Bor Lam, Suzanne M. Seager, Bing Wei, Raphael Yuster:
Some remarks on domination. 207-210 - András Gyárfás, Gábor Simonyi:
Edge colorings of complete graphs without tricolored triangles. 211-216 - Igor E. Zverovich, Inessa I. Zverovich:
Forbidden induced subgraph characterization of cograph contractions. 217-226 - Drago Bokal, Gasper Fijavz, Martin Juvan, P. Mark Kayll, Bojan Mohar:
The circular chromatic number of a digraph. 227-240
Volume 46, Number 4, August 2004
- József Balogh, Pascal Ochem, András Pluhár:
On the interval number of special graphs. 241-253 - Mekkia Kouider, Zbigniew Lonc:
Stability number and [a, b]-factors in graphs. 254-264 - Jørgen Bang-Jensen, Jing Huang, Anders Yeo:
Spanning k-arc-strong subdigraphs with few arcs in k-arc-strong tournaments. 265-284 - Karen L. Collins, Kimberly Tysdal:
Dependent edges in Mycielski graphs and 4-colorings of 4-skeletons. 285-296 - Young Soo Kwon:
New regular embeddings of n-cubes Qn. 297-312 - Pavol Hell, Jing Huang:
Interval bigraphs and circular arc graphs. 313-327
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 2023-06-09 20:45 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:
