Pages that link to "Item:Q1026014"

The following pages link to Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences (Q1026014):

Displaying 26 items.

• Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences (Q412344) (← links)
• Graphs of separability at most 2 (Q415268) (← links)
• On the forbidden induced subgraph sandwich problem (Q643008) (← links)
• Combinatorial optimization with 2-joins (Q765197) (← links)
• Structure and algorithms for (cap, even hole)-free graphs (Q1685999) (← links)
• A note on chromatic number of (cap, even hole)-free graphs (Q1712540) (← links)
• Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey (Q1733849) (← links)
• On the structure of (even hole, kite)-free graphs (Q1756042) (← links)
• Two classes of \(\beta \)-perfect graphs that do not necessarily have simplicial extremes (Q2032702) (← links)
• The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs (Q2173431) (← links)
• Weight choosability of graphs with maximum degree 4 (Q2194741) (← links)
• Structural domination and coloring of some \(( P_7 , C_7)\)-free graphs (Q2222949) (← links)
• Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds (Q2341752) (← links)
• A faster algorithm to recognize even-hole-free graphs (Q2347846) (← links)
• Colouring diamond-free graphs (Q2402373) (← links)
• On the chromatic number of (\(P_6\), diamond)-free graphs (Q2413634) (← links)
• Vizing bound for the chromatic number on some graph classes (Q2631086) (← links)
• Graphs of Separability at Most Two: Structural Characterizations and Their Consequences (Q3000517) (← links)
• On the structure of (pan, even hole)‐free graphs (Q4604020) (← links)
• Perfectly contractile diamond-free graphs (Q4719326) (← links)
• Hereditary Efficiently Dominatable Graphs (Q5325951) (← links)
• (Q5743476) (← links)
• Strong cliques in diamond-free graphs (Q5919069) (← links)
• Finding a shortest even hole in polynomial time (Q6057650) (← links)
• Tree independence number. I. (Even hole, diamond, pyramid)-free graphs (Q6565817) (← links)
• Linear <i>χ</i> -binding functions for some classes of ( <i>P</i> ₃ ∪ <i>P</i> ₂ )-free graphs (Q6643347) (← links)