Pages that link to "Item:Q277625"
From MaRDI portal
The following pages link to Dynamic coloring of graphs having no \(K_5\) minor (Q277625):
Displaying 13 items.
- On colorability of graphs with forbidden minors along paths and circuits (Q533778) (← links)
- \(K_{5}\)-free bound for the class of planar graphs (Q852707) (← links)
- Coloring algorithms for \(K_ 5\)-minor free graphs (Q910220) (← links)
- Note on coloring graphs without odd-\(K_k\)-minors (Q1026013) (← links)
- A counterexample to montgomery's conjecture on dynamic colourings of regular graphs (Q2012068) (← links)
- The total coloring of \(K_5\)-minor-free graphs (Q2122692) (← links)
- Graph \(r\)-hued colorings -- a survey (Q2172387) (← links)
- Decomposition and \(r\)-hued coloring of \(K_4(7)\)-minor free graphs (Q2189858) (← links)
- Dynamic proper colorings of a graph (Q2256703) (← links)
- Dynamic list coloring of 1-planar graphs (Q2659245) (← links)
- The structure and the list 3-dynamic coloring of outer-1-planar graphs (Q5024667) (← links)
- Weak-dynamic coloring of graphs beyond-planarity (Q6144496) (← links)
- List dynamic 4-coloring of planar graphs (Q6660058) (← links)
