Pages that link to "Item:Q3055915"
From MaRDI portal
The following pages link to Coloring plane graphs with independent crossings (Q3055915):
Displaying 20 items.
- Recognizing and drawing IC-planar graphs (Q290513) (← links)
- Drawing complete multipartite graphs on the plane with restrictions on crossings (Q477904) (← links)
- L-visibility drawings of IC-planar graphs (Q903189) (← links)
- New results on edge partitions of 1-plane graphs (Q1694686) (← links)
- \(\mathsf{T}\)-shape visibility representations of 1-planar graphs (Q1702255) (← links)
- Neighbor sum distinguishing total coloring of sparse IC-planar graphs (Q1706133) (← links)
- Equitable coloring of three classes of 1-planar graphs (Q1753367) (← links)
- The structure of plane graphs with independent crossings and its applications to coloring problems (Q1935605) (← links)
- Acyclic edge coloring of IC-planar graphs (Q2023729) (← links)
- List edge coloring of outer-1-planar graphs (Q2023746) (← links)
- An improved upper bound for the acyclic chromatic number of 1-planar graphs (Q2192086) (← links)
- Neighbor sum distinguishing total choosability of IC-planar graphs (Q2282486) (← links)
- Remarks on the joins of 1-planar graphs (Q2286052) (← links)
- Equitable partition of plane graphs with independent crossings into induced forests (Q2305905) (← links)
- Acyclic coloring of IC-planar graphs (Q2329208) (← links)
- An annotated bibliography on 1-planarity (Q2407041) (← links)
- \(\mathsf{NIC}\)-planar graphs (Q2410219) (← links)
- Weak-dynamic coloring of graphs beyond-planarity (Q6144496) (← links)
- IC-planar graphs are odd-10-colorable (Q6160615) (← links)
- The linear 2-arboricity of IC-planar graphs (Q6166036) (← links)
