Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 48
Volume 48, Number 1, January 2005
- Anna S. Lladó
, Susana-Clara López:
Edge-decompositions of Kn, n into isomorphic copies of a given tree. 1-18 - Marcelo Henriques de Carvalho, Claudio L. Lucchesi, Uppaluri S. R. Murty:
Graphs with independent perfect matchings. 19-50 - Feng Ming Dong:
Further results on the lower bounds of mean color numbers. 51-73 - James F. Geelen, Bert Gerards:
Regular matroid decomposition via signed graphs. 74-84
Volume 48, Number 2, February 2005
- Maria Chudnovsky, Ken-ichi Kawarabayashi, Paul D. Seymour:
Detecting even holes. 85-111 - Edy Tri Baskoro, Mirka Miller, Jozef Sirán, Martin Sutton:
Complete characterization of almost Moore digraphs of degree three. 112-126 - Jesper Makholm Byskov, Bolette Ammitzbøll Madsen, Bjarke Skjernaa:
On the number of maximal bipartite subgraphs of a graph. 127-132 - Atsushi Kaneko, Mikio Kano, Kazuhiro Suzuki:
Partitioning complete multipartite graphs by monochromatic trees. 133-141 - Hong-Jian Lai, Yehong Shao, Mingquan Zhan:
Hamiltonian N2-locally connected claw-free graphs. 142-146 - Daniela Kühn, Deryk Osthus:
Four-cycles in graphs without a given even cycle. 147-156 - Wayne Goddard, Michael A. Henning:
Multiple vertex coverings by cliques. 157-167
Volume 48, Number 3, March 2005
- Hal A. Kierstead:
Asymmetric graph coloring games. 169-185 - Xuding Zhu:
Circular perfect graphs. 186-209 - Xuding Zhu:
Circular choosability of graphs. 210-218 - Yuqing Lin, Mirka Miller, Chris Rodger:
All (k;g)-cages are k-edge-connected. 219-227 - Angelika Hellwig, Lutz Volkmann:
Sufficient conditions for graphs to be lambda'-optimal, super-edge-connected, and maximally edge-connected. 228-246
Volume 48, Number 4, April 2005
- Xingxing Yu:
Infinite paths in planar graphs II, structures and ladder nets. 247-266 - Tomás Kaiser, Mingchu Li, Zdenek Ryjácek, Liming Xiong:
Hourglasses and Hamilton cycles in 4-connected claw-free graphs. 267-276 - Elaine M. Eschen, Chính T. Hoàng, Mark D. T. Petrick, R. Sritharan:
Disjoint clique cutsets in graphs without long holes. 277-298 - Daniel Král, Jana Maxová, Robert Sámal, Pavel Podbrdský:
Hamilton cycles in strong products of graphs. 299-321 - Vasyl Dmytrenko, Felix Lazebnik, Raymond Viglione:
Isomorphism criterion for monomial graphs. 322-328 - Daphne Der-Fen Liu, Xuding Zhu:
Erratum to: "Fractional chromatic number and circular chromatic number for distance graphs with large clique size" Journal of Graph Theory 47(2) 2004, 129-146. 329-330
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-04-25 05:29 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:
