𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Reducible chains of planar 1-cycle resonant graphs

✍ Scribed by Xiaofeng Guo; Fuji Zhang

Book ID
108315886
Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
387 KB
Volume
275
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Planar k-cycle resonant graphs with k=1,
Planar k-cycle resonant graphs with k=1,2
✍ Xiaofeng Guo; Fuji Zhang πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 200 KB

A connected graph is said to be k-cycle resonant if, for 1 6 t 6 k, any t disjoint cycles in G are mutually resonant, that is, there is a perfect matching M of G such that each of the t cycles is an M -alternating cycle. The concept of k-cycle resonant graphs was introduced by the present authors in

Reducible chains in several types of 2-c
Reducible chains in several types of 2-connected graphs
✍ Fuji Zhang; Xiaofeng Guo πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 423 KB

Zhang, F. and X. Guo, Reducible chains in several types of 2-connected graphs, Discrete Mathematics 105 (1992) 285-291. Let F& 4, $ and 8 denote the sets of all 2-connected graphs, minimally 2-connected graphs, critically 2-connected graphs, and critically and minimally 2-connected graphs, respecti

Planar Graphs Without Cycles of Specific
Planar Graphs Without Cycles of Specific Lengths
✍ G. FijavΕΎ; M. Juvan; B. Mohar; R. Ε krekovski πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 208 KB

It is easy to see that planar graphs without 3-cycles are 3-degenerate. Recently, it was proved that planar graphs without 5-cycles are also 3-degenerate. In this paper it is shown, more surprisingly, that the same holds for planar graphs without 6-cycles.

Induced packing of odd cycles in planar
Induced packing of odd cycles in planar graphs
✍ Petr A. Golovach; Marcin KamiΕ„ski; DaniΓ«l Paulusma; Dimitrios M. Thilikos πŸ“‚ Article πŸ“… 2012 πŸ› Elsevier Science 🌐 English βš– 286 KB