Pages that link to "Item:Q958679"

The following pages link to Bisimplicial vertices in even-hole-free graphs (Q958679):

Displaying 22 items.

• Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors (Q505914) (← links)
• Induced subgraphs of graphs with large chromatic number. IV: Consecutive holes (Q723885) (← links)
• Triangulated neighborhoods in even-hole-free graphs (Q870966) (← links)
• Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences (Q1026014) (← links)
• Structure and algorithms for (cap, even hole)-free graphs (Q1685999) (← links)
• Some problems on induced subgraphs (Q1693168) (← 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)
• Algorithms for induced biclique optimization problems (Q1944925) (← links)
• A better upper bound on the chromatic number of (cap, even-hole)-free graphs (Q1981707) (← links)
• Corrigendum to: ``Bisimplicial vertices in even-hole-free graphs'' (Q1985455) (← links)
• Induced subgraphs and tree decompositions. I: Even-hole-free graphs of bounded degree (Q2171016) (← links)
• The intersection of two vertex coloring problems (Q2303434) (← links)
• A faster algorithm to recognize even-hole-free graphs (Q2347846) (← links)
• Coloring graphs with no even hole \(\geqslant 6\): the triangle-free case (Q2363699) (← links)
• On the chromatic number of (\(P_6\), diamond)-free graphs (Q2413634) (← links)
• Vertex elimination orderings for hereditary graph classes (Q2514166) (← links)
• On the structure of (pan, even hole)‐free graphs (Q4604020) (← links)
• Even-hole-free graphs still have bisimplicial vertices (Q6038593) (← links)
• Finding a shortest even hole in polynomial time (Q6057650) (← links)
• An optimal χ‐bound for (P6, diamond)‐free graphs (Q6080859) (← links)