Pages that link to "Item:Q1686052"
From MaRDI portal
The following pages link to A coloring algorithm for \(4 K_1\)-free line graphs (Q1686052):
Displaying 6 items.
- A simple algorithm for 4-coloring 3-colorable planar graphs (Q974757) (← links)
- On coloring a class of claw-free and hole-twin-free graphs (Q2091797) (← links)
- Vertex coloring \((4K_1\), hole-twin, 5-wheel)-free graphs (Q2124227) (← links)
- On coloring a class of claw-free graphs. (Q2132368) (← links)
- On the structure of graphs without claw, \(4K_1\) and co-R (Q2158304) (← links)
- Characterizations of \((4 K_1,C_4,C_5)\)-free graphs (Q2403803) (← links)