default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 230
Volume 230, Number 1-3, March 2001
- Arthur M. Hobbs, Hong-Jian Lai:
Dedication. 1- - Arthur M. Hobbs, Hong-Jian Lai, Neil Robertson:
Paul Catlin 1948-1995. 3-12 - Edgar M. Palmer:
On the spanning tree packing number of a graph: a survey. 13-21 - Herbert Fleischner:
(Some of) the many uses of Eulerian graphs in graph theory (plus some applications). 23-43 - Heiko Harborth:
Eulerian straight ahead cycles in drawings of complete bipartite graphs. 45-48 - Anna Lee, Gábor Révész, Jenö Szigeti, Zsolt Tuza:
Capelli polynomials, almost-permutation matrices and sparse Eulerian graphs. 49-61 - Hong-Jian Lai:
Eulerian subgraphs containing given edges. 63-69 - Paul A. Catlin, Arthur M. Hobbs, Hong-Jian Lai:
Graph family operations. 71-97 - Ronald J. Gould:
Results on degrees and the structure of 2-factors. 99-111 - Xiaotao Cai, Warren E. Shreve:
Pancyclicity mod k of claw-free graphs and K1, 4-free graphs. 113-118 - Leizhen Cai, Derek G. Corneil, Andrzej Proskurowski:
Stable 2-pairs and (X, Y)-intersection graphs. 119-131 - Zhi-Hong Chen, Hong-Jian Lai, Hongyuan Lai:
Nowhere zero flows in line graphs. 133-141 - Cun-Quan Zhang:
On strong 1-factors and Hamilton weights of cubic graphs. 143-148 - Alexander K. Kelmans:
On graph planarity and semi-duality. 149-166 - Alexander K. Kelmans:
On Homotopy of connected graphs having the same degree function. 167-187 - Rajeev Govindan, Siddharthan Ramachandramurthi:
A weak immersion relation on graphs and its applications. 189-206 - Neil Robertson, Xiaoya Zha:
Closed 2-cell embeddings of graphs with no V8-minors. 207-213 - Michael J. Dinneen, Kevin Cattell, Michael R. Fellows
:
Forbidden minors to graphs with small feedback sets. 215-252 - J. J. Spencer:
The question of the collapsibility of random 3-regular graphs. 253-
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 2025-01-23 20:20 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:
