Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 53
Volume 53, Number 1, 2006
- Maria Chudnovsky
:
Berge trigraphs. 1-55 - Vojtech Rödl, Mark H. Siggers:
Color critical hypergraphs with many edges. 56-74 - Tamás Mátrai:
Covering the edges of a graph by three odd subgraphs. 77-82
Volume 53, Number 2, October 2006
- Guantao Chen, Warren E. Shreve, Bing Wei:
Hamiltonian graphs involving neighborhood unions. 83-100 - Stefanie Gerke, Catherine S. Greenhill, Nicholas C. Wormald:
The generalized acyclic edge chromatic number of random regular graphs. 101-125 - Raphael Yuster:
Mean Ramsey-Turán numbers. 126-134 - Michael O. Albertson, Debra L. Boutin:
Distinguishing geometric graphs. 135-150 - Mario Lomelí-Haro, Gelasio Salazar:
Nearly light cycles in embedded graphs and crossing-critical graphs. 151-156 - Arthur H. Busch, Michael S. Jacobson, K. Brooks Reid:
On arc-traceable tournaments. 157-166 - David R. Wood:
Vertex partitions of chordal graphs. 167-172
Volume 53, Number 3, November 2006
- Xingxing Yu:
Infinite paths in planar graphs IV, dividing cycles. 173-195 - Noga Alon, Rados Radoicic, Benny Sudakov, Jan Vondrák:
A Ramsey-type result for the hypercube. 196-208 - Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich:
Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms. 209-232 - David Défossez:
Clique-coloring some classes of odd-hole-free graphs. 233-249 - Wilfried Imrich, Sandi Klavzar:
Distinguishing Cartesian powers of graphs. 250-260
Volume 53, Number 4, December 2006
- Carsten Thomassen:
On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese postman problem for a planar triangulation. 261-269 - Goh Chee Ying, Khee Meng Koh, Bruce E. Sagan, Vincent R. Vatter:
Maximal independent sets in graphs with at most r cycles. 270-282 - Bruce E. Sagan, Vincent R. Vatter:
Maximal and maximum independent sets in graphs with at most r cycles. 283-314 - Stéphane Bessy, Frédéric Havet, Etienne Birmelé:
Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree. 315-332 - Jinfeng Feng, Hans-Erik Giesen, Yubao Guo, Gregory Z. Gutin, Tommy R. Jensen, Arash Rafiey:
Characterization of edge-colored complete graphs with properly colored Hamilton paths. 333-346
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-17 20:32 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:
