\(k\)-cycle resonant graphs
DOI10.1016/0012-365X(93)E0086-JzbMath0810.05047OpenAlexW2080629167MaRDI QIDQ1343255
Publication date: 1 February 1995
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(93)e0086-j
Applications of graph theory (05C90) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Related Items (7)
Cites Work
- Ear-decompositions of matching-covered graphs
- Matching theory
- On n-extendable graphs
- When each hexagon of a hexagonal system covers it
- On minimal elementary bipartite graphs
- Ear Decompositions of Elementary Graphs and GF2-rank of Perfect Matchings
- On a Family of Planar Bicritical Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: \(k\)-cycle resonant graphs