Forbidden Subgraphs Generating Almost the Same Sets

DOI10.1017/S0963548313000254zbMath1282.05167MaRDI QIDQ5397729

Michitaka Furuya, Kenta Ozeki, Shinya Fujita

Publication date: 24 February 2014

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

zbMATH Keywords

\(\mathcal{H}\)-free graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

Implications in rainbow forbidden subgraphs ⋮ Forbidden pairs with a common graph generating almost the same sets

Cites Work

• Unnamed Item
• Forbidden induced subgraphs for star-free graphs
• Connectivity of Cartesian product graphs
• Characterizing forbidden pairs for hamiltonian properties
• Vertex colouring and forbidden subgraphs -- a survey
• A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity
• A pair of forbidden subgraphs and perfect matchings.
• A Pair of Forbidden Subgraphs and 2-Factors
• Forbidden subgraphs that imply hamiltonian‐connectedness*
• Graph classes characterized both by forbidden subgraphs and degree sequences

This page was built for publication: Forbidden Subgraphs Generating Almost the Same Sets