Forbidden induced subgraphs for star-free graphs
From MaRDI portal
Publication:409360
DOI10.1016/J.DISC.2011.07.022zbMATH Open1238.05144OpenAlexW2070473368MaRDI QIDQ409360FDOQ409360
Authors: Jun Fujisawa, Katsuhiro Ota, Kenta Ozeki, Gabriel Sueiro 
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
Recommendations
- Forbidden subgraphs for \(k\) vertex-disjoint stars
- scientific article; zbMATH DE number 2202192
- Forbidden triples containing a complete graph and a complete bipartite graph of small order
- The structure of \(\{ K_{1,3},Z_2\}\)-free graphs
- Forbidden triples generating a finite set of graphs with minimum degree three
Extremal problems in graph theory (05C35) Connectivity (05C40) Structural characterization of families of graphs (05C75)
Cites Work
- Title not available (Why is that?)
- Claw-free graphs---a survey
- Title not available (Why is that?)
- Characterizing forbidden pairs for hamiltonian properties
- Forbidden subgraphs that imply hamiltonian‐connectedness*
- 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
- Potential forbidden triples implying hamiltonicity: for sufficiently large graphs
- Forbidden triples and traceability: A characterization
- Traceability in graphs with forbidden triples of subgraphs
- Title not available (Why is that?)
Cited In (14)
- Forbidden subgraphs and the existence of a 2-walk
- Induced subgraphs and tree decompositions. VII: Basic obstructions in \(H\)-free graphs
- Classes of graphs without star forests and related graphs
- On the Complexity of Reconstructing H-free Graphs from Their Star Systems
- Forbidden subgraphs for \(k\) vertex-disjoint stars
- Forbidden subgraphs generating almost the same sets
- Forbidden induced subgraphs for perfect matchings
- Pairs of forbidden induced subgraphs for homogeneously traceable graphs
- Forbidden induced subgraphs of double-split graphs
- Line graphs and forbidden induced subgraphs
- The feasibility problem: the family \(\mathcal{F}(G)\) of all induced \(G\)-free graphs.
- Title not available (Why is that?)
- Forbidden Induced Subgraphs for Toughness
- Forbidden pairs with a common graph generating almost the same sets
This page was built for publication: Forbidden induced subgraphs for star-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q409360)
