Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 51
Volume 51, Number 1, January 2006
- Konstantin A. Rybnikov, Thomas Zaslavsky
:
Cycle and circle tests of balance in gain graphs: Forbidden minors and their groups. 1-21 - Paul N. Balister, Jenö Lehel, Richard H. Schelp:
Ramsey unsaturated and saturated graphs. 22-32 - Claude Tardif, David L. Wehlau:
Chromatic numbers of products of graphs: The directed and undirected versions of the Poljak-Rödl function. 33-36 - Zoltán Füredi, André Kündgen:
Moments of graphs in monotone families. 37-48 - Vojislav Petrovic, Carsten Thomassen:
Edge-disjoint Hamiltonian cycles in hypertournaments. 49-52 - Fedor V. Fomin, Dimitrios M. Thilikos:
New upper bounds on the decomposability of planar graphs. 53-81 - Mariusz Meszka, Zdzislaw Skupien:
Decompositions of a complete multidigraph into nonhamiltonian paths. 82-91
Volume 51, Number 2, February 2006
- Mickaël Montassier, André Raspaud:
(d, 1)-total labeling of graphs with a given maximum average degree. 93-109 - Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña:
Graph relations, clique divergence and surface triangulations. 110-122 - Anthony Bonato:
Spanning subgraphs of graphs partitioned into two isomorphic pieces. 123-136 - Rostislav Caha, Václav Koubek:
Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets. 137-169 - Li Zhang, Baoyindureng Wu:
A note on the cover degeneracy of graphs. 170-173
Volume 51, Number 3, March 2006
- Xingxing Yu:
Infinite paths in planar graphs III, 1-way infinite paths. 175-198 - Reza Naserasr, Claude Tardif:
The chromatic covering number of a graph. 199-204 - Matthias Kriesell:
Average degree and contractibility. 205-224 - Juan José Montellano-Ballesteros:
On totally multicolored stars. 225-243 - Jian Shen:
On two Turán Numbers. 244-250 - Richard C. Bradley:
On the number of colorings of a snark minus an edge. 251-259 - Atsuhiro Nakamoto, Tadashi Sakuma, Yusuke Suzuki:
N-flips in even triangulations on the sphere. 260-268
Volume 51, Number 4, April 2006
- Daniela Kühn, Deryk Osthus:
Matchings in hypergraphs of large minimum degree. 269-280 - Mickaël Montassier, Pascal Ochem, André Raspaud:
On the acyclic choosability of graphs. 281-300 - David Cariolaro:
On fans in multigraphs. 301-318 - Daniel Král, Riste Skrekovski:
The last excluded case of Dirac's map-color theorem for choosability. 319-354
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-08-23 18:30 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:
