Forbidden subgraphs generating a finite set

DOI10.1016/j.disc.2012.05.015zbMath1277.05120OpenAlexW2023434610MaRDI QIDQ383734

Jun Fujisawa, Akira Saito, Michael D. Plummer

Publication date: 6 December 2013

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

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

zbMATH Keywords

Hamiltonian cyclesforbidden subgraphs\(k\)-connected graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Forbidden triples generating a finite set of graphs with minimum degree three, 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 triples generating a finite set of 3-connected graphs, Forbidden triples containing a complete graph and a complete bipartite graph of small order, Forbidden quadruplets generating a finite set of 2-connected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphs and digraphs with given girth and connectivity
• Characterizing forbidden pairs for hamiltonian properties
• Characterizing forbidden clawless triples implying Hamiltonian graphs
• Forbidden triples for Hamiltonicity
• A pair of forbidden subgraphs and perfect matchings.
• Forbidden subgraphs and the existence of a 2-factor
• On super edge-connectivity of Cartesian product graphs
• Locally homogeneous graphs from groups
• 1-Factors and Antifactor Sets
• 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