Forbidden induced subgraphs for star-free graphs
From MaRDI portal
Publication:409360
DOI10.1016/j.disc.2011.07.022zbMath1238.05144OpenAlexW2070473368MaRDI QIDQ409360
Jun Fujisawa, Kenta Ozeki, Gabriel Sueiro, Katsuhiro Ota
Publication date: 13 April 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.07.022
Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Connectivity (05C40)
Related Items (3)
Forbidden subgraphs and the existence of a 2-walk ⋮ Forbidden induced subgraphs for perfect matchings ⋮ Forbidden Subgraphs Generating Almost the Same Sets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Forbidden triples and traceability: A characterization
- Claw-free graphs---a survey
- Characterizing forbidden pairs for hamiltonian properties
- Traceability in graphs with forbidden triples of subgraphs
- 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
- Forbidden subgraphs that imply hamiltonian‐connectedness*
- Potential forbidden triples implying hamiltonicity: for sufficiently large graphs
This page was built for publication: Forbidden induced subgraphs for star-free graphs