Pages that link to "Item:Q818664"
From MaRDI portal
The following pages link to A linear-time algorithm for 7-coloring 1-plane graphs (Q818664):
Displayed 14 items.
- On edge colorings of 1-toroidal graphs (Q353624) (← links)
- Proper 1-immersions of graphs triangulating the plane (Q394202) (← links)
- On drawings and decompositions of 1-planar graphs (Q396768) (← links)
- 1-planarity of complete multipartite graphs (Q412349) (← links)
- The matching extendability of optimal 1-planar graphs (Q1756050) (← links)
- Planar graphs having no proper 2-immersions in the plane. I (Q2037555) (← links)
- \(K_7\)-minors in optimal 1-planar graphs (Q2400554) (← links)
- An annotated bibliography on 1-planarity (Q2407041) (← links)
- Minimal non-1-planar graphs (Q2470008) (← links)
- A note on odd colorings of 1-planar graphs (Q2689651) (← links)
- Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing (Q3611864) (← links)
- Edge Partitions and Visibility Representations of 1-planar Graphs (Q5001658) (← links)
- Note on improper coloring of $1$-planar graphs (Q5206449) (← links)
- All 2-planar graphs having the same spanning subgraph (Q6087085) (← links)