Pages that link to "Item:Q2303434"

The following pages link to The intersection of two vertex coloring problems (Q2303434):

Displaying 12 items.

• The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable (Q828645) (← links)
• Coloring the complements of intersection graphs of geometric figures (Q941403) (← links)
• The vertex coloring problem and its generalizations (Q1022440) (← links)
• On the structure of (even hole, kite)-free graphs (Q1756042) (← 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)
• K4-free graphs with no odd hole: Even pairs and the circular chromatic number (Q3061190) (← links)
• Choice of the control variables of an isolated intersection by graph colouring (Q5278837) (← links)
• Even-hole-free graphs still have bisimplicial vertices (Q6038593) (← 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)