Pages that link to "Item:Q4736767"
From MaRDI portal
The following pages link to Planar graph colorings without short monochromatic cycles (Q4736767):
Displaying 10 items.
- Total coloring of planar graphs without chordal short cycles (Q497376) (← links)
- Incidence coloring of planar graphs without adjacent small cycles (Q501990) (← links)
- Three-coloring planar graphs without short cycles (Q845915) (← links)
- 2-list-coloring planar graphs without monochromatic triangles (Q958693) (← links)
- Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs (Q1751242) (← links)
- Planar graphs without normally adjacent short cycles (Q2144582) (← links)
- Planar Ramsey graphs (Q2327223) (← links)
- Short proofs of coloring theorems on planar graphs (Q2441638) (← links)
- Colorings of plane graphs without long monochromatic facial paths (Q2656334) (← links)
- Disjoint total dominating sets in near‐triangulations (Q6142659) (← links)