Light subgraphs of graphs embedded in the plane. A survey
From MaRDI portal
Publication:1937552
DOI10.1016/j.disc.2012.11.007zbMath1259.05045OpenAlexW2048002956MaRDI QIDQ1937552
Stanlislav Jendroľ, Heinz-Juergen Voss
Publication date: 1 March 2013
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2012.11.007
Planar graphs; geometric and topological aspects of graph theory (05C10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Signed and weighted graphs (05C22)
Related Items (84)
The height of faces of 3-polytopes ⋮ All tight descriptions of 3-paths in plane graphs with girth at least 9 ⋮ Weight of edges in normal plane maps ⋮ All tight descriptions of 4-paths in 3-polytopes with minimum degree 5 ⋮ A Steinberg-like approach to describing faces in 3-polytopes ⋮ An analogue of Franklin's theorem ⋮ The weight of faces in normal plane maps ⋮ Light subgraphs in graphs with average degree at most four ⋮ Unnamed Item ⋮ Low 5-stars in normal plane maps with minimum degree 5 ⋮ 3-vertices with fewest 2-neighbors in plane graphs with no long paths of 2-vertices ⋮ Light 3-stars in sparse plane graphs ⋮ Another tight description of faces in plane triangulations with minimum degree 4 ⋮ Strong isoperimetric inequalities and combinatorial curvatures on multiply connected planar graphs ⋮ Describing neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and without vertices of degrees from 7 to 11 ⋮ An extension of Kotzig's theorem ⋮ Combinatorial structure of faces in triangulations on surfaces ⋮ The structure of 1-planar graphs ⋮ Light graphs in families of outerplanar graphs ⋮ Lightness, heaviness and gravity ⋮ Decomposing degenerate graphs into locally irregular subgraphs ⋮ Refined weight of edges in normal plane maps ⋮ On relative clique number of triangle-free planar colored mixed graphs ⋮ All tight descriptions of 3-paths in plane graphs with girth at least 7 ⋮ Heights of minor faces in 3-polytopes ⋮ The impact of emigration on Slovak mathematics: the case of the Bratislava graph theory seminar ⋮ The 7-cycle \(C_{7}\) is light in the family of planar graphs with minimum degree 5 ⋮ Describing \((d-2)\)-stars at \(d\)-vertices, \(d\leq 5\), in normal plane maps ⋮ Describing 4-stars at 5-vertices in normal plane maps with minimum degree 5 ⋮ Relative clique number of planar signed graphs ⋮ All tight descriptions of 3-paths in plane graphs with girth 8 ⋮ Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11 ⋮ Describing 3-faces in normal plane maps with minimum degree 4 ⋮ Describing faces in plane triangulations ⋮ Light \(C_4\) and \(C_5\) in 3-polytopes with minimum degree 5 ⋮ Structure of edges of embedded graphs with minimum degree two ⋮ On the maximum weight of a planar graph of given order and size ⋮ Tight description of faces of triangulations on the torus ⋮ 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 ⋮ Light minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices ⋮ The vertex-face weight of edges in 3-polytopes ⋮ Light 3-paths in 3-polytopes without adjacent triangles ⋮ An extension of Franklin's theorem ⋮ Split Euler tours in 4-regular planar graphs ⋮ Light graphs in planar graphs of large girth ⋮ More about the height of faces in 3-polytopes ⋮ Soft 3-stars in sparse plane graphs ⋮ Combinatorial structure of faces in triangulated 3-polytopes with minimum degree 4 ⋮ Describing short paths in plane graphs of girth at least 5 ⋮ Minor stars in plane graphs with minimum degree five ⋮ On the existence of specific stars in planar graphs ⋮ All tight descriptions of 3-stars in 3-polytopes with girth 5 ⋮ An introduction to the discharging method via graph coloring ⋮ Describing 4-paths in 3-polytopes with minimum degree 5 ⋮ Light paths and edges in families of outer-1-planar graphs ⋮ A study on oriented relative clique number ⋮ On large light graphs in families of polyhedral graphs ⋮ An improvement of Lebesgue's description of edges in 3-polytopes and faces in plane quadrangulations ⋮ Light subgraphs of order at most 3 in large maps of minimum degree 5 on compact 2-manifolds ⋮ Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight ⋮ Islands in Graphs on Surfaces ⋮ Light edges in 1-planar graphs of minimum degree 3 ⋮ Light edges in 3-connected 2-planar graphs with prescribed minimum degree ⋮ A tight description of 3-polytopes by their major 3-paths ⋮ On the weight of minor faces in triangle-free 3-polytopes ⋮ Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27 ⋮ Structure of edges in plane graphs with bounded dual edge weight ⋮ All tight descriptions of major 3-paths in 3-polytopes without 3-vertices ⋮ Heights of minor faces in triangle-free 3-polytopes ⋮ Low edges in 3-polytopes ⋮ Low minor faces in 3-polytopes ⋮ Each 3-polytope with minimum degree 5 has a 7-cycle with maximum degree at most 15 ⋮ Tight description of faces in torus triangulations with minimum degree 5 ⋮ Light minor 5-stars in 3-polytopes with minimum degree 5 ⋮ Describing the neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 6 to 8 ⋮ Describing faces in 3-polytopes with no vertices of degree from 5 to 7 ⋮ Low faces of restricted degree in 3-polytopes ⋮ All tight descriptions of 3-paths centered at 2-vertices in plane graphs with girth at least 6 ⋮ On clique numbers of colored mixed graphs ⋮ Note on 3-paths in plane graphs of girth 4 ⋮ Light 3-stars in embedded graphs ⋮ Tight Descriptions of 3‐Paths in Normal Plane Maps ⋮ Describing minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 or 7
This page was built for publication: Light subgraphs of graphs embedded in the plane. A survey
