Pages that link to "Item:Q2303434"
From MaRDI portal
The following pages link to The intersection of two vertex coloring problems (Q2303434):
Displaying 6 items.
- The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable (Q828645) (← links)
- The computational complexity of weighted vertex coloring for \(\{P_5,K_{2,3},K^+_{2,3}\}\)-free graphs (Q1996748) (← links)
- A note on coloring \((4K_1, C_4, C_6)\)-free graphs with a \(C_7\) (Q2674382) (← 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)
- Coloring \((4K_1,C_4,C_6)\)-free graphs (Q6091816) (← links)
