Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles

DOI10.1016/J.DISC.2018.05.001zbMath1388.05125OpenAlexW2807176617WikidataQ129759547 ScholiaQ129759547MaRDI QIDQ1637143

Michitaka Furuya, Yoshimi Egawa

Publication date: 7 June 2018

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

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

zbMATH Keywords

factor-critical graphpseudo 2-factorcomponent factor

Mathematics Subject Classification ID

Paths and cycles (05C38) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

Remarks on component factors ⋮ Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles

Cites Work

• Unnamed Item
• Graph factors and factorization: 1985--2003: a survey
• On pseudo 2-factors
• An extension of matching theory
• Efficient subgraphs packing
• Partition of a graph into cycles and degenerated cycles
• The existence of a path-factor without small odd paths
• Perfect triangle-free 2-matchings
• Sufficient conditions for the existence of a path‐factor which are related to odd components
• Path-factors involving paths of order seven and nine
• The Factors of Graphs
• The 1-Factors of Oriented Graphs
• Hamiltonian cycles in \(n\)-factor-critical graphs

This page was built for publication: Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles