Planar \(k\)-cycle resonant graphs with \(k=1,2\)

DOI10.1016/S0166-218X(02)00577-2zbMath1028.05051MaRDI QIDQ1406034

Xiaofeng Guo, Fu Ji Zhang

Publication date: 9 September 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

perfect matchingbridgesattachment verticescycle-related vertices

Mathematics Subject Classification ID

Applications of graph theory (05C90) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

A characterization of 1-cycle resonant graphs among bipartite 2-connected plane graphs ⋮ Computing the permanental polynomials of bipartite graphs by Pfaffian orientation ⋮ Reducible chains of planar 1-cycle resonant graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ear-decompositions of matching-covered graphs
• Matching theory
• On n-extendable graphs
• When each hexagon of a hexagonal system covers it
• Directed tree structure of the set of Kekulé patterns of generalized polyhex graphs
• Recognition of essentially disconnected benzenoids
• On minimal elementary bipartite graphs
• \(k\)-cycle resonant graphs
• Ear Decompositions of Elementary Graphs and GF2-rank of Perfect Matchings
• On a Family of Planar Bicritical Graphs
• The Calculation of Matrix Elements for Lewis Electronic Structures of Molecules

This page was built for publication: Planar \(k\)-cycle resonant graphs with \(k=1,2\)