A Pair of Forbidden Subgraphs and 2-Factors

DOI10.1017/S0963548311000514zbMath1238.05211MaRDI QIDQ2883858

Akira Saito, Jun Fujisawa

Publication date: 14 May 2012

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40) Vertex degrees (05C07)

Related Items (5)

Forbidden pairs of disconnected graphs for 2‐factor of connected graphs ⋮ On 2-factors with a bounded number of odd components ⋮ Pairs of forbidden induced subgraphs for homogeneously traceable graphs ⋮ Forbidden Subgraphs Generating Almost the Same Sets ⋮ Forbidden subgraphs for existences of (connected) 2-factors of a graph

Cites Work

• Forbidden subgraphs and Hamiltonian properties and graphs
• Characterizing forbidden pairs for hamiltonian properties
• Forbidden subgraphs that imply 2-factors
• A pair of forbidden subgraphs and perfect matchings.
• A degree condition for the existence of regular factors inK1,n-free graphs
• The Factors of Graphs

This page was built for publication: A Pair of Forbidden Subgraphs and 2-Factors