Structure of edges of embedded graphs with minimum degree two
From MaRDI portal
Recommendations
Cites work
- A Kotzig type theorem for non-orientable surfaces
- An extension of Kotzig's theorem
- Analogues for Tilings of Kotzig'S Theorem on Minimal Weights of Edges
- Describing short paths in plane graphs of girth at least 5
- Graph theory
- scientific article; zbMATH DE number 125461 (Why is no real title available?)
- scientific article; zbMATH DE number 2172910 (Why is no real title available?)
- scientific article; zbMATH DE number 1359497 (Why is no real title available?)
- scientific article; zbMATH DE number 3189017 (Why is no real title available?)
- Light subgraphs of graphs embedded in the plane. A survey
- On the total coloring of planar graphs.
- Recursive constructions of small regular graphs of given degree and girth
- Topological graph theory.
- Weight of edges in normal plane maps
Cited in
(5)- Structure of edges in plane graphs with bounded dual edge weight
- Note on an existence of small degree vertices with at most one big degree neighbour in planar graphs
- On the structure of polyhedral graphs with prescribed edge and dual edge weight
- A Kotzig type theorem for non-orientable surfaces
- Light edges in 3-connected 2-planar graphs with prescribed minimum degree
This page was built for publication: Structure of edges of embedded graphs with minimum degree two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6057637)