(Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels (Q6080861): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On rank-width of even-hole-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-theoretic concepts in computer science. 26th international workshop, WG 2000, Konstanz, Germany, June 15--17, 2000. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of (pan, even hole)‐free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure and algorithms for (cap, even hole)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-free graphs. IV: Decomposition theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluded Grid Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4500707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds to the clique width of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Relationship Between Clique-Width and Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365068 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-in-a-path problem for claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2766682 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5749319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Class of Three‐Colorable Triangle‐Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. V. Excluding a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alpha-balanced graphs and matrices and GF(3)-representability of matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even-hole-free graphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The world of hereditary graph classes viewed through Truemper configurations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles and Connectivity in Graphs / rank
 
Normal rank

Revision as of 01:40, 3 August 2024

scientific article; zbMATH DE number 7745572
Language Label Description Also known as
English
(Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels
scientific article; zbMATH DE number 7745572

    Statements

    (Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels (English)
    0 references
    0 references
    0 references
    4 October 2023
    0 references
    even-hole-free graph
    0 references
    theta-free graph
    0 references
    treewidth
    0 references

    Identifiers