On light cycles in plane triangulations
From MaRDI portal
Publication:1292852
DOI10.1016/S0012-365X(99)90099-7zbMATH Open0936.05065OpenAlexW4210570893MaRDI QIDQ1292852FDOQ1292852
Zsolt Tuza, Tomáš Madaras, Roman Soták, Stanislav Jendroľ
Publication date: 13 February 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(99)90099-7
Recommendations
Cites Work
- On the total coloring of planar graphs.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minimal vertex degree sum of a 3-path in plane maps
- Short cycles of low weight in normal plane maps with minimum degree 5
- On light subgraphs in plane graphs of minimum degree five
- Paths with restricted degrees of their vertices in planar graphs
- Title not available (Why is that?)
- On vertex-degree restricted paths in polyhedral graphs
- On Light Edges and Triangles in Planar Graphs of Minimum Degree Five
- Triangles with restricted degree sum of their boundary vertices in plane graphs
- Subgraphs with restricted degrees of their vertices in planar 3-connected graphs
Cited In (24)
- Light \(C_4\) and \(C_5\) in 3-polytopes with minimum degree 5
- Title not available (Why is that?)
- On large light graphs in families of polyhedral graphs
- Light subgraphs in planar graphs of minimum degree 4 and edge‐degree 9
- Light subgraphs of order at most 3 in large maps of minimum degree 5 on compact 2-manifolds
- Light paths in 4-connected graphs in the plane and other surfaces
- Title not available (Why is that?)
- Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight
- Four gravity results
- Lightness, heaviness and gravity
- An analogue of Franklin's theorem
- The structure of 1-planar graphs
- On doubly light triangles in plane graphs
- Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11
- Light graphs in families of outerplanar graphs
- Weights of induced subgraphs in \(K_{1,r}\)-free graphs
- Each 3-polytope with minimum degree 5 has a 7-cycle with maximum degree at most 15
- Nearly light cycles in embedded graphs and crossing-critical graphs
- The 7-cycle \(C_{7}\) is light in the family of planar graphs with minimum degree 5
- On the Decay of Crossing Numbers of Sparse Graphs
- On \(3\)-connected plane graphs without triangular faces
- Light triangles in plane graphs with near-independent crossings
- All tight descriptions of 3-stars in 3-polytopes with girth 5
- Heavy paths, light stars, and big melons
This page was built for publication: On light cycles in plane triangulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292852)
