Light edges in 1-planar graphs with prescribed minimum degree
From MaRDI portal
Publication:4648786
zbMATH Open1262.05032MaRDI QIDQ4648786FDOQ4648786
Authors: Peter Šugerek, Dávid Hudák 
Publication date: 16 November 2012
Recommendations
- Light edges in 1‐planar graphs
- Strongly light subgraphs in the 1-planar graphs with minimum degree 7
- Light edges in 1-planar graphs of minimum degree 3
- New upper bounds for the heights of some light subgraphs in 1-planar graphs with high minimum degree
- Light subgraphs in the family of 1-planar graphs with high minimum degree
Cited In (15)
- The structure and the list 3-dynamic coloring of outer-1-planar graphs
- Light paths and edges in families of outer-1-planar graphs
- On the lightness of chordal 4-cycle in 1-planar graphs with high minimum degree
- Planar graphs having no proper 2-immersions in the plane. I
- Light edges in degree-constrained graphs
- All 2-planar graphs having the same spanning subgraph
- Light edges in 1‐planar graphs
- On the edge-connectivity and restricted edge-connectivity of optimal 1-planar graphs
- On edge colorings of 1-toroidal graphs
- An annotated bibliography on 1-planarity
- From light edges to strong edge-colouring of 1-planar graphs
- Matchings in 1‐planar graphs with large minimum degree
- More on the structure of plane graphs with prescribed degrees of vertices, faces, edges and dual edges
- Light edges in 1-planar graphs of minimum degree 3
- Light subgraphs in the family of 1-planar graphs with high minimum degree
This page was built for publication: Light edges in 1-planar graphs with prescribed minimum degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4648786)
