On cycle-nice claw-free graphs

DOI10.1016/j.disc.2022.112876zbMath1490.05224OpenAlexW4214872516MaRDI QIDQ2138970

Yanyan Li

Publication date: 17 May 2022

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

Full work available at URL: https://doi.org/10.1016/j.disc.2022.112876

zbMATH Keywords

claw-free graphperfect matchingPfaffian graphnice cycle

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs
• Ear decomposition of factor-critical graphs and number of maximum matchings
• Brick decompositions and the matching rank of graphs
• Matching theory
• Matching structure and the matching lattice
• Extending matchings in claw-free graphs
• A note on degree conditions for Hamiltonicity in 2-connected claw-free graphs
• Claw-free graphs---a survey
• Hamiltonian cycles in 3-connected claw-free graphs
• Hamiltonicity of claw-free graphs and Fan-type conditions
• A characterization of convertible (0,1)-matrices
• A characterisation of Pfaffian near bipartite graphs
• A generalization of Little's theorem on Pfaffian orientations
• The Pfaffian property of Cayley graphs on dihedral groups
• Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs
• On essentially 4-edge-connected cubic bricks
• Ear decomposition and induced even cycles
• Hamiltonian results inK1,3-free graphs
• Even cycles and perfect matchings in claw-free plane graphs
• Hamiltonian cycles in 3‐connected claw‐free graphs