Pages that link to "Item:Q2380043"
From MaRDI portal
The following pages link to Acyclic coloring of graphs of maximum degree five: nine colors are enough (Q2380043):
Displaying 18 items.
- Acyclically 4-colorable triangulations (Q264190) (← links)
- Acyclic total colorings of planar graphs without \(l\) cycles (Q475741) (← links)
- Acyclic vertex coloring of graphs of maximum degree 5 (Q626789) (← links)
- Acyclic and star colorings of cographs (Q643025) (← links)
- Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs (Q668443) (← links)
- Graphs with maximum degree \(6\) are acyclically \(11\)-colorable (Q1944128) (← links)
- Acyclic choosability of graphs with bounded degree (Q2119462) (← links)
- Acyclic coloring of claw-free graphs with small degree (Q2172408) (← links)
- Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6 (Q2279264) (← links)
- Acyclic coloring of graphs and entropy compression method (Q2297725) (← links)
- Acyclic coloring of graphs with maximum degree at most six (Q2324491) (← links)
- The \(r\)-acyclic chromatic number of planar graphs (Q2343993) (← links)
- Acyclic vertex coloring of graphs of maximum degree six (Q2449135) (← links)
- Acyclic coloring of graphs with maximum degree 7 (Q2657099) (← links)
- On b-acyclic chromatic number of a graph (Q2685280) (← links)
- Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope (Q2826670) (← links)
- (Q5874489) (← links)
- A polyhedral study of the acyclic coloring problem (Q5916097) (← links)
