Pages that link to "Item:Q2403803"
From MaRDI portal
The following pages link to Characterizations of \((4 K_1,C_4,C_5)\)-free graphs (Q2403803):
Displaying 17 items.
- The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable (Q828645) (← links)
- Enumerative aspects of certain subclasses of perfect graphs (Q1301836) (← links)
- Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs (Q1633754) (← links)
- The computational complexity of weighted vertex coloring for \(\{P_5,K_{2,3},K^+_{2,3}\}\)-free graphs (Q1996748) (← links)
- Vertex coloring \((4K_1\), hole-twin, 5-wheel)-free graphs (Q2124227) (← links)
- On the clique-width of \(( 4 K_1 , C_4 , C_5 , C_7 )\)-free graphs (Q2197487) (← links)
- The intersection of two vertex coloring problems (Q2303434) (← links)
- A note on coloring \((4K_1, C_4, C_6)\)-free graphs with a \(C_7\) (Q2674382) (← links)
- Which graphs can be counted in \(C_4\)-free graphs? (Q2694950) (← links)
- A New Characterization of $$P_k$$-free Graphs (Q2945184) (← links)
- (Q4627666) (← 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)
- $(2P_2,K_4)$-Free Graphs are 4-Colorable (Q5232143) (← links)
- On the structure and clique‐width of (4K1,C4,C6,C7)‐free graphs (Q6057651) (← links)
- Clique‐width: Harnessing the power of atoms (Q6062871) (← links)
- A complete complexity dichotomy of the edge-coloring problem for all sets of 8-edge forbidden subgraphs (Q6644082) (← links)
