default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 63
Volume 63, Number 1, January 2010
- Marina Groshaus, Jayme Luiz Szwarcfiter:
Biclique graphs and biclique matrices. 1-16 - Tatsuya Honjo, Ken-ichi Kawarabayashi, Atsuhiro Nakamoto
:
Dominating sets in triangulations on surfaces. 17-30 - Nicolas Trotignon, Kristina Vuskovic:
A structure theorem for graphs with no cycle with a unique chord and its consequences. 31-67 - Michael O. Albertson, Hannah Alpert, sarah-marie belcastro, Ruth Haas:
Grünbaum colorings of toroidal triangulations. 68-81 - Dirk Meierling:
Solution of a conjecture of Tewes and Volkmann regarding extendable cycles in in-tournaments. 82-92
Volume 63, Number 2, February 2010
- Wolfgang Mader:
Existence of openly disjoint circuits through a vertex. 93-105 - Kinkar Chandra Das, Sang-Gu Lee, Gi-Sang Cheon:
On the conjecture for certain Laplacian integral spectrum of graphs. 106-113 - Odile Favaron, François Genest, Mekkia Kouider:
Regular path decompositions of odd regular graphs. 114-128 - Zdenek Dvorák, Daniel Král', Riste Skrekovski:
Non-rainbow colorings of 3-, 4- and 5-connected plane graphs. 129-145 - Andrew Bowler, Paul Brown, Trevor I. Fenner:
Families of pairs of graphs with a large number of common cards. 146-163 - Jason I. Brown, Richard Hoshino:
Proof of a conjecture on fractional Ramsey numbers. 164-178
Volume 63, Number 3, March 2010
- Vladimir P. Korzhik:
Finite fields and the 1-chromatic number of orientable surfaces. 179-184 - Michael Krivelevich, Raphael Yuster:
The rainbow connection of a graph is (at most) reciprocal to its minimum degree. 185-191 - Andreas Holtkamp, Lutz Volkmann:
On local connectivity of graphs with given clique number. 192-197 - Jaroslav Nesetril, Claude Tardif:
Path homomorphisms, graph colorings, and boolean matrices. 198-209 - Baogang Xu, Juan Yan, Xingxing Yu:
Balanced judicious bipartitions of graphs. 210-225 - Manu Basavaraju, L. Sunil Chandran, Manoj Kummini:
d-Regular graphs of acyclic chromatic index at least d+2. 226-230 - Barry Balof, Christopher Storm:
Constructing isospectral non-isomorphic digraphs from hypergraphs. 231-242 - Manuel Welhan:
Reconstructing trees from two cards. 243-257
Volume 63, Number 4, April 2010
- Maria Chudnovsky, Alexandra Ovetsky Fradkin:
An approximate version of Hadwiger's conjecture for claw-free graphs. 259-278 - Ruixia Wang, Aimin Yang, Shiying Wang:
Kings in locally semicomplete digraphs. 279-287 - András Gyárfás, Gábor N. Sárközy, Endre Szemerédi:
Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs. 288-299 - Jia Shen:
Subgraph-avoiding coloring of graphs. 300-310 - Wensong Lin, Daphne Der-Fen Liu, Xuding Zhu:
Multi-coloring the Mycielskian of graphs. 311-323 - André Kündgen, Craig Timmons:
Star coloring planar graphs from small lists. 324-337 - Jed Yang:
Vertex-pancyclicity of hypertournaments. 338-348
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-11-07 20:34 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:
