Pages that link to "Item:Q1685999"
From MaRDI portal
The following pages link to Structure and algorithms for (cap, even hole)-free graphs (Q1685999):
Displaying 25 items.
- Stable sets and graphs with no even holes (Q745687) (← links)
- The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable (Q828645) (← links)
- Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences (Q1026014) (← 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 tree-width of even-hole-free graphs (Q1979431) (← links)
- A better upper bound on the chromatic number of (cap, even-hole)-free graphs (Q1981707) (← links)
- The computational complexity of weighted vertex coloring for \(\{P_5,K_{2,3},K^+_{2,3}\}\)-free graphs (Q1996748) (← links)
- Two classes of \(\beta \)-perfect graphs that do not necessarily have simplicial extremes (Q2032702) (← links)
- Finding a smallest odd hole in a claw-free graph using global structure (Q2444540) (← links)
- Even-hole-free graphs part II: Recognition algorithm (Q3150171) (← links)
- Even and odd holes in cap-free graphs (Q4238043) (← links)
- On the structure of (banner, odd hole)‐free graphs (Q4646946) (← links)
- Even-hole-free graphs: A survey (Q4899861) (← links)
- Complete complexity dichotomy for $7$-edge forbidden subgraphs in the edge coloring problem (Q5090168) (← links)
- Efficient solvability of the weighted vertex coloring problem for some two hereditary graph classes (Q5100120) (← links)
- Clique‐width: Harnessing the power of atoms (Q6062871) (← links)
- A class of graphs with large rankwidth (Q6080165) (← links)
- (Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels (Q6080861) (← links)
- (Theta, triangle)‐free and (even hole, K4)‐free graphs. Part 2: Bounds on treewidth (Q6080868) (← links)
- Coloring \((4K_1,C_4,C_6)\)-free graphs (Q6091816) (← links)
- Induced subgraphs and tree decompositions. IV: (Even hole, diamond, pyramid)-free graphs (Q6106299) (← links)
- Tree independence number. I. (Even hole, diamond, pyramid)-free graphs (Q6565817) (← links)
- A complete complexity dichotomy of the edge-coloring problem for all sets of 8-edge forbidden subgraphs (Q6644082) (← links)
- On the chromatic number of a family of odd hole free graphs (Q6670771) (← links)
