Pages that link to "Item:Q958693"
From MaRDI portal
The following pages link to 2-list-coloring planar graphs without monochromatic triangles (Q958693):
Displaying 8 items.
- A linear-time algorithm for clique-coloring problem in circular-arc graphs (Q512872) (← links)
- Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete (Q730005) (← links)
- Colorings of oriented planar graphs avoiding a monochromatic subgraph (Q2166215) (← links)
- Clique-transversal sets and clique-coloring in planar graphs (Q2441644) (← links)
- Colorings of plane graphs without long monochromatic facial paths (Q2656334) (← links)
- Coloring graphs using two colors while avoiding monochromatic cycles (Q2815462) (← links)
- List coloring triangle‐free planar graphs (Q5110692) (← links)
- Disjoint total dominating sets in near‐triangulations (Q6142659) (← links)