Pages that link to "Item:Q4238043"

The following pages link to Even and odd holes in cap-free graphs (Q4238043):

Displaying 32 items.

• Graphs of separability at most 2 (Q415268) (← links)
• On the forbidden induced subgraph sandwich problem (Q643008) (← links)
• Stable sets and graphs with no even holes (Q745687) (← 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)
• Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs (Q1405122) (← links)
• Negative (and positive) circles in signed graphs: a problem collection (Q1643910) (← links)
• Structure and algorithms for (cap, even hole)-free graphs (Q1685999) (← links)
• Decomposition techniques applied to the clique-stable set separation problem (Q1709553) (← 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)
• A better upper bound on the chromatic number of (cap, even-hole)-free graphs (Q1981707) (← links)
• Erdős-Hajnal for cap-free graphs (Q1984528) (← links)
• Two classes of \(\beta \)-perfect graphs that do not necessarily have simplicial extremes (Q2032702) (← links)
• Induced subgraphs and tree decompositions. I: Even-hole-free graphs of bounded degree (Q2171016) (← links)
• The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs (Q2173431) (← links)
• A faster algorithm to recognize even-hole-free graphs (Q2347846) (← links)
• Solving the clique cover problem on (bull, \(C_4\))-free graphs (Q2414459) (← links)
• Vertex elimination orderings for hereditary graph classes (Q2514166) (← links)
• Even-hole-free graphs. I: Decomposition theorem (Q2778281) (← links)
• Amalgams and χ-Boundedness (Q2958199) (← links)
• Graphs of Separability at Most Two: Structural Characterizations and Their Consequences (Q3000517) (← links)
• Even-hole-free graphs part II: Recognition algorithm (Q3150171) (← links)
• (Q4500707) (← links)
• On the structure of (banner, odd hole)‐free graphs (Q4646946) (← links)
• Even-hole-free graphs: A survey (Q4899861) (← links)
• A structure theorem for graphs with no cycle with a unique chord and its consequences (Q5189239) (← links)
• Hereditary Efficiently Dominatable Graphs (Q5325951) (← links)
• Odd Hole Recognition in Graphs of Bounded Clique Size (Q5470814) (← links)
• (Q5743476) (← links)
• Recognition of quasi-Meyniel graphs (Q5951967) (← links)
• Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths (Q6647761) (← links)