scientific article; zbMATH DE number 1743771

zbMATH Open0995.05118MaRDI QIDQ4529264FDOQ4529264

Authors: Ronald Gould, Emily A. Hynds 

Publication date: 24 October 2002

Title of this publication is not available (Why is that?)

Recommendations

• Forbidden subgraphs that imply 2-factors
• Forbidden subgraphs for existences of (connected) 2-factors of a graph
• Forbidden subgraphs that imply 2-factors with a specified number of components
• A pair of forbidden subgraphs and 2-factors
• Pairs and triples of forbidden subgraphs and the existence of a 2-factor

zbMATH Keywords

Hamiltonian cyclecharacterization2-factorforbidden subgraphs

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Cited In (16)

• Forbidden subgraphs that imply 2-factors with a specified number of components
• Title not available (Why is that?)
• Forbidden subgraphs and 2‐factors in 3/2‐tough graphs
• Pairs and triples of forbidden subgraphs and the existence of a 2-factor
• Forbidden subgraphs for existences of (connected) 2-factors of a graph
• Graphs and digraphs with all 2-factors isomorphic
• 2‐factors with prescribed and proscribed edges
• Forbidden subgraphs and the existence of a 2-factor
• Title not available (Why is that?)
• Forbidden pairs of disconnected graphs for 2‐factor of connected graphs
• A characterization of a graph which has a 2-factor
• 2-factors with \(k\) cycles in Hamiltonian graphs
• Degree conditions for 2-factors
• Forbidden subgraphs that imply 2-factors
• A pair of forbidden subgraphs and 2-factors
• On the difference between Hamilton cycles and 2-factors with a prescribed number of cycles

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4529264)