The structure of 1-planar graphs
From MaRDI portal
Publication:868353
DOI10.1016/J.DISC.2005.11.056zbMATH Open1111.05026OpenAlexW2045730620MaRDI QIDQ868353FDOQ868353
Authors: Igor Fabrici, Tomáš Madaras
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
Recommendations
Cites Work
- Light subgraphs of graphs embedded in the plane. A survey
- Ein Sechsfarbenproblem auf der Kugel
- Title not available (Why is that?)
- On light cycles in plane triangulations
- Title not available (Why is that?)
- On light subgraphs in plane graphs of minimum degree five
- On vertex-degree restricted paths in polyhedral graphs
- Heavy paths, light stars, and big melons
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On \(3\)-connected plane graphs without triangular faces
- Subgraphs with restricted degrees of their vertices in planar 3-connected graphs
- On light graphs in 3-connected plane graphs without triangular or quadrangular faces
Cited In (92)
- Proper 1-immersions of graphs triangulating the plane
- A linear-time algorithm for testing outer-1-planarity
- On edge colorings of \(1\)-planar graphs
- Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles
- On drawings and decompositions of 1-planar graphs
- A note on 1-planar graphs
- 1-planarity of complete multipartite graphs
- An improved upper bound on the linear 2-arboricity of 1-planar graphs
- Contact representations of graphs in 3D
- Optimal 1-planar graphs which triangulate other surfaces
- A structure of 1-planar graph and its applications to coloring problems
- The structure and the list 3-dynamic coloring of outer-1-planar graphs
- On the maximum weight of a dense connected graph of given order and size
- Facial entire colouring of plane graphs
- The matching extendability of optimal 1-planar graphs
- On the sum of powers of the degrees of graphs
- Light paths and edges in families of outer-1-planar graphs
- Equitable coloring of three classes of 1-planar graphs
- Outer 1-planar graphs
- A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system
- Light edges in 3-connected 2-planar graphs with prescribed minimum degree
- On equitable colorings of sparse graphs
- On the maximum weight of a sparse connected graph of given order and size
- On local properties of 1-planar graphs with high minimum degree
- An upper bound on the sum of powers of the degrees of simple 1-planar graphs
- 1-planar graphs without 4-cycles or 5-cycles are 5-colorable
- On local structure of 1-planar graphs of minimum degree 5 and girth 4
- On the sizes of bipartite 1-planar graphs
- Nonrepetitive vertex colorings of graphs
- Light structures in 1-planar graphs with an application to linear 2-arboricity
- An improved upper bound for the acyclic chromatic number of 1-planar graphs
- Minimal non-1-planar graphs
- Relationship among triangulations, quadrangulations and optimal 1-planar graphs
- On properties of maximal 1-planar graphs
- A classification of all 1-Salem graphs
- Joins of 1-planar graphs
- Straight-line grid drawings of 3-connected 1-planar graphs
- A note on 1-planar graphs with minimum degree 7
- Right angle crossing graphs and 1-planarity
- The structure of plane graphs with independent crossings and its applications to coloring problems
- Light edges in 1‐planar graphs
- On edge colorings of 1-planar graphs without adjacent triangles
- On an extremal problem in the class of bipartite 1-planar graphs
- On edge colorings of 1-toroidal graphs
- An annotated bibliography on 1-planarity
- Triangle-free planar graphs with small independence number
- Right angle crossing graphs and 1-planarity
- The maximal 1-planarity and crossing numbers of graphs
- On \((p,1)\)-total labelling of 1-planar graphs
- List edge and list total coloring of 1-planar graphs
- On partitioning the edges of 1-plane graphs
- Characterizing and recognizing 4-map graphs
- On the recognition of fan-planar and maximal outer-fan-planar graphs
- Drawing graph joins in the plane with restrictions on crossings
- Light edges in 1-planar graphs of minimum degree 3
- Light subgraphs in the family of 1-planar graphs with high minimum degree
- Spectral extrema of 1-planar graphs
- Title not available (Why is that?)
- 1-planar graphs with girth at least 6 are (1,1,1,1)-colorable
- Title not available (Why is that?)
- 1-Planar Graphs
- \(K_7\)-minors in optimal 1-planar graphs
- Note on improper coloring of 1-planar graphs.
- Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time
- Title not available (Why is that?)
- Re-embedding a 1-plane graph for a straight-line drawing in linear time
- On restricted matching extension of 1-embeddable graphs in surfaces with small genus
- On \((p, 1)\)-total labelling of NIC-planar graphs
- Linear arboricity of NIC-planar graphs
- Connectivity and planarity of \(g\)-noncommuting graph of finite groups
- 1-planar graphs are odd 13-colorable
- Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles
- Beyond planar graphs: introduction
- Algorithms for 1-Planar Graphs
- Planar graphs having no proper 2-immersions in the plane. I
- The vertex arboricity of 1-planar graphs
- Title not available (Why is that?)
- Long cycles and spanning subgraphs of locally maximal 1-planar graphs
- Crossing lemma for the odd-crossing number
- On \((p, 1)\)-total labelling of some 1-planar graphs
- The linear 2-arboricity of 1-planar graphs without 3-cycles
- A new note on 1-planar graphs with minimum degree 7
- All 2-planar graphs having the same spanning subgraph
- The structure and the bondage number of three classes of beyond-planar graphs
- Remarks on the joins of 1-planar graphs
- Title not available (Why is that?)
- On the Size of Matchings in 1-Planar Graph with High Minimum Degree
- The surviving rate of NIC-planar graphs
- From light edges to strong edge-colouring of 1-planar graphs
- Maximal 1-plane graphs with dominating vertices
- The maximum matching extendability and factor-criticality of 1-planar graphs
- More on the structure of plane graphs with prescribed degrees of vertices, faces, edges and dual edges
This page was built for publication: The structure of 1-planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868353)