Recommendations
- Tight descriptions of 3-paths in normal plane maps
- Describing tight descriptions of 3-paths in triangle-free normal plane maps
- All one-term tight descriptions of 3-paths in normal plane maps without \(K_4 - e\)
- Minimal vertex degree sum of a 3-path in plane maps
- Describing 3-faces in normal plane maps with minimum degree 4
Cites work
- A structural property of convex 3-polytopes
- scientific article; zbMATH DE number 64356 (Why is no real title available?)
- scientific article; zbMATH DE number 3541571 (Why is no real title available?)
- Joint extension of two theorems of Kotzig on 3-polytopes
- Minimal vertex degree sum of a 3-path in plane maps
- On the total coloring of planar graphs.
- Paths with restricted degrees of their vertices in planar graphs
- Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and faces
Cited in
(30)- All tight descriptions of 3-paths in plane graphs with girth at least 9
- All one-term tight descriptions of 3-paths in normal plane maps without \(K_4 - e\)
- A tight description of 3-polytopes by their major 3-paths
- All tight descriptions of major 3-paths in 3-polytopes without 3-vertices
- All tight descriptions of 3-paths in plane graphs with girth 8
- An extension of Franklin's theorem
- Soft 3-stars in sparse plane graphs
- All tight descriptions of 3-paths centered at 2-vertices in plane graphs with girth at least 6
- Note on 3-paths in plane graphs of girth 4
- Describing tight descriptions of 3-paths in triangle-free normal plane maps
- All tight descriptions of 4-paths in 3-polytopes with minimum degree 5
- Low 5-stars in normal plane maps with minimum degree 5
- Light 3-stars in sparse plane graphs
- All tight descriptions of 3-paths in plane graphs with girth at least 7
- 3-paths in graphs with bounded average degree
- An analogue of Franklin's theorem
- Light subgraphs in graphs with average degree at most four
- Upper bounds for domination related parameters in graphs on surfaces
- Describing (d-2)-stars at d-vertices, d 5, in normal plane maps
- Describing 3-faces in normal plane maps with minimum degree 4
- Light C₄ and C₅ in 3-polytopes with minimum degree 5
- Minimal vertex degree sum of a 3-path in plane maps
- Describing short paths in plane graphs of girth at least 5
- Describing 4-paths in 3-polytopes with minimum degree 5
- Tight descriptions of 3-paths in normal plane maps
- Light 3-paths in 3-polytopes without adjacent triangles
- Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27
- Weight of 3-paths in sparse plane graphs
- Optimal unavoidable sets of types of 3-paths for planar graphs of given girth
- Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices
This page was built for publication: Describing 3-paths in normal plane maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q394206)
