Forbidden subgraphs and the existence of a 2-factor

DOI10.1002/jgt.20454zbMath1208.05104MaRDI QIDQ3055922

Jun Fujisawa, Akira Saito, R. E. L. Aldred

Publication date: 10 November 2010

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20454

zbMATH Keywords

2-factor; induced subgraph; star; forbidden subgraph

Mathematics Subject Classification ID

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

Related Items

Tree in forbidden triples generating a finite set of graphs with high connectivity, FORBIDDEN TRIPLES GENERATING A FINITE SET OF GRAPHS WITH HIGH CONNECTIVITY, Forbidden pairs of disconnected graphs for supereulerianity of connected graphs, Forbidden subgraphs generating a finite set, Forbidden induced subgraphs for star-free graphs, Pairs of forbidden induced subgraphs for homogeneously traceable graphs, Characterization of forbidden subgraphs for the existence of even factors in a graph, Minimal forbidden sets for degree sequence characterizations

Cites Work

• Unnamed Item
• Characterizing forbidden pairs for hamiltonian properties
• Characterizing forbidden clawless triples implying Hamiltonian graphs
• Forbidden subgraphs that imply 2-factors
• A pair of forbidden subgraphs and perfect matchings.
• Forbidden triples implying Hamiltonicity: for all graphs
• Forbidden subgraphs and bounds on the size of a maximum matching
• Potential forbidden triples implying hamiltonicity: for sufficiently large graphs