The structure of 1-planar graphs
From MaRDI portal
Publication:868353
DOI10.1016/j.disc.2005.11.056zbMath1111.05026OpenAlexW2045730620MaRDI QIDQ868353
Publication date: 2 March 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2005.11.056
Related Items (79)
On the maximum weight of a dense connected graph of given order and size ⋮ An improved upper bound on the linear 2-arboricity of 1-planar graphs ⋮ Outer 1-planar graphs ⋮ On the Size of Matchings in 1-Planar Graph with High Minimum Degree ⋮ On the maximum weight of a sparse connected graph of given order and size ⋮ Contact Representations of Graphs in 3D ⋮ Triangle-free planar graphs with small independence number ⋮ Connectivity and planarity of g-noncommuting graph of finite groups ⋮ On edge colorings of 1-toroidal graphs ⋮ \(K_7\)-minors in optimal 1-planar graphs ⋮ An annotated bibliography on 1-planarity ⋮ On the recognition of fan-planar and maximal outer-fan-planar graphs ⋮ The book thickness of 1-planar graphs is constant ⋮ A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system ⋮ Proper 1-immersions of graphs triangulating the plane ⋮ On drawings and decompositions of 1-planar graphs ⋮ Right Angle Crossing Graphs and 1-Planarity ⋮ 1-planar graphs are odd 13-colorable ⋮ Light edges in 1‐planar graphs ⋮ A note on 1-planar graphs ⋮ The structure of plane graphs with independent crossings and its applications to coloring problems ⋮ All 2-planar graphs having the same spanning subgraph ⋮ An improved upper bound for the acyclic chromatic number of 1-planar graphs ⋮ The maximum matching extendability and factor-criticality of 1-planar graphs ⋮ 1-planarity of complete multipartite graphs ⋮ Relationship among triangulations, quadrangulations and optimal 1-planar graphs ⋮ On edge colorings of 1-planar graphs without adjacent triangles ⋮ Facial entire colouring of plane graphs ⋮ 1-planar graphs with girth at least 6 are (1,1,1,1)-colorable ⋮ Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time ⋮ On edge colorings of \(1\)-planar graphs ⋮ A new note on 1-planar graphs with minimum degree 7 ⋮ More on the structure of plane graphs with prescribed degrees of vertices, faces, edges and dual edges ⋮ On an extremal problem in the class of bipartite 1-planar graphs ⋮ Right angle crossing graphs and 1-planarity ⋮ Unnamed Item ⋮ A note on 1-planar graphs with minimum degree 7 ⋮ Unnamed Item ⋮ On \((p,1)\)-total labelling of 1-planar graphs ⋮ Unnamed Item ⋮ An upper bound on the sum of powers of the degrees of simple 1-planar graphs ⋮ Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles ⋮ Nonrepetitive vertex colorings of graphs ⋮ Joins of 1-planar graphs ⋮ On \((p, 1)\)-total labelling of some 1-planar graphs ⋮ Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles ⋮ A linear-time algorithm for testing outer-1-planarity ⋮ Re-embedding a 1-plane graph for a straight-line drawing in linear time ⋮ Characterizing and recognizing 4-map graphs ⋮ On partitioning the edges of 1-plane graphs ⋮ On \((p, 1)\)-total labelling of NIC-planar graphs ⋮ Minimal non-1-planar graphs ⋮ Light paths and edges in families of outer-1-planar graphs ⋮ Equitable coloring of three classes of 1-planar graphs ⋮ The matching extendability of optimal 1-planar graphs ⋮ Light subgraphs in the family of 1-planar graphs with high minimum degree ⋮ A structure of 1-planar graph and its applications to coloring problems ⋮ List edge and list total coloring of 1-planar graphs ⋮ Light edges in 1-planar graphs of minimum degree 3 ⋮ Light edges in 3-connected 2-planar graphs with prescribed minimum degree ⋮ On the sizes of bipartite 1-planar graphs ⋮ On equitable colorings of sparse graphs ⋮ Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing ⋮ Remarks on the joins of 1-planar graphs ⋮ Planar graphs having no proper 2-immersions in the plane. I ⋮ Note on improper coloring of $1$-planar graphs ⋮ The maximal 1-planarity and crossing numbers of graphs ⋮ Linear arboricity of NIC-planar graphs ⋮ Light structures in 1-planar graphs with an application to linear 2-arboricity ⋮ Optimal 1-planar graphs which triangulate other surfaces ⋮ Beyond Planar Graphs: Introduction ⋮ 1-Planar Graphs ⋮ Algorithms for 1-Planar Graphs ⋮ Drawing graph joins in the plane with restrictions on crossings ⋮ From light edges to strong edge-colouring of 1-planar graphs ⋮ ON THE SUM OF POWERS OF THE DEGREES OF GRAPHS ⋮ The structure and the list 3-dynamic coloring of outer-1-planar graphs ⋮ The linear 2-arboricity of 1-planar graphs without 3-cycles ⋮ 1-planar graphs without 4-cycles or 5-cycles are 5-colorable
Cites Work
- On light cycles in plane triangulations
- Subgraphs with restricted degrees of their vertices in planar 3-connected graphs
- On \(3\)-connected plane graphs without triangular faces
- Heavy paths, light stars, and big melons
- Light subgraphs of graphs embedded in the plane. A survey
- On vertex-degree restricted paths in polyhedral graphs
- Ein Sechsfarbenproblem auf der Kugel
- On light subgraphs in plane graphs of minimum degree five
- On light graphs in 3-connected plane graphs without triangular or quadrangular faces
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The structure of 1-planar graphs
