Pages that link to "Item:Q1078192"
From MaRDI portal
The following pages link to The chromatic number of graphs which induce neither \(K_{1,3}\) nor \(K_ 5-e\) (Q1078192):
Displaying 7 items.
- Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences (Q1026014) (← links)
- Applications of edge coloring of multigraphs to vertex coloring of graphs (Q1121898) (← links)
- Claw-free graphs---a survey (Q1356695) (← links)
- Borodin-Kostochka's conjecture on \((P_5,C_4)\)-free graphs (Q2053188) (← links)
- Graph coloring approach with new upper bounds for the chromatic number: team building application (Q4611483) (← links)
- Strengthening Brooks' chromatic bound on \(P_6\)-free graphs (Q6143873) (← links)
- Borodin-Kostochka conjecture holds for \(\overline{K_{1 , 3}} \)-free graphs (Q6585266) (← links)
