scientific article
From MaRDI portal
Publication:3679212
zbMath0565.05027MaRDI QIDQ3679212
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (91)
Total coloring of 1-toroidal graphs with maximum degree at least 11 and no adjacent triangles ⋮ Graph polynomials and paintability of plane graphs ⋮ On a Heawood-type problem for maps with tangencies ⋮ Facial list colourings of plane graphs ⋮ Third case of the cyclic coloring conjecture ⋮ Simultaneously colouring the edges and faces of plane graphs ⋮ On the \(d\)-distance face chromatic number of plane graphs ⋮ A tighter bounding interval for the 1-chromatic number of a surface ⋮ A new proof of Grünbaum's 3 color theorem ⋮ Cyclic 4-Colorings of Graphs on Surfaces ⋮ An infinite series of surfaces with known 1-chromatic number ⋮ A possibly infinite series of surfaces with known 1-chromatic number ⋮ On the colorings of outerplanar graphs ⋮ On edge colorings of 1-toroidal graphs ⋮ The structure of 1-planar graphs ⋮ \(K_7\)-minors in optimal 1-planar graphs ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ Dynamic list coloring of 1-planar graphs ⋮ Cyclic coloring of plane graphs with maximum face size 16 and 17 ⋮ An annotated bibliography on 1-planarity ⋮ A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system ⋮ Proper 1-immersions of graphs triangulating the plane ⋮ 1-planar graphs are odd 13-colorable ⋮ The structure of plane graphs with independent crossings and its applications to coloring problems ⋮ All 2-planar graphs having the same spanning subgraph ⋮ Simultaneous coloring of vertices and incidences of outerplanar graphs ⋮ On the 1-chromatic number of nonorientable surfaces with large genus ⋮ 1-planarity of complete multipartite graphs ⋮ Facial entire colouring of plane graphs ⋮ 1-planar graphs with girth at least 6 are (1,1,1,1)-colorable ⋮ Parity vertex colouring of plane graphs ⋮ Weak-dynamic coloring of graphs beyond-planarity ⋮ On edge colorings of \(1\)-planar graphs ⋮ Coverage with \(k\)-transmitters in the presence of obstacles ⋮ A unified approach to distance-two colouring of graphs on surfaces ⋮ Distance-two coloring of sparse graphs ⋮ On the cyclic coloring conjecture ⋮ A survey on the cyclic coloring and its relaxations ⋮ A note on total colorings of 1-planar graphs ⋮ On \((p,1)\)-total labelling of 1-planar graphs ⋮ Beyond Outerplanarity ⋮ Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs ⋮ List 2-facial 5-colorability of plane graphs with girth at least 12 ⋮ Drawing complete multipartite graphs on the plane with restrictions on crossings ⋮ On \((p, 1)\)-total labelling of some 1-planar graphs ⋮ Cyclic colorings of plane graphs with independent faces ⋮ Research problems ⋮ A linear-time algorithm for testing outer-1-planarity ⋮ Minimal non-1-planar graphs ⋮ Cyclic coloring of plane graphs ⋮ Equitable coloring of three classes of 1-planar graphs ⋮ Another step towards proving a conjecture by Plummer and Toft ⋮ 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 ⋮ Facial colorings using Hall's theorem ⋮ Cyclic, diagonal and facial colorings ⋮ Coloring vertices and faces of maps on surfaces ⋮ Coloring plane graphs with independent crossings ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ Acyclic colouring of 1-planar graphs ⋮ On plane drawings of 2-planar graphs ⋮ Light edges in 3-connected 2-planar graphs with prescribed minimum degree ⋮ Coloring non-crossing strings ⋮ Third Case of the Cyclic Coloring Conjecture ⋮ Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing ⋮ Planar graphs having no proper 2-immersions in the plane. I ⋮ Note on improper coloring of $1$-planar graphs ⋮ Acyclic edge coloring of triangle-free 1-planar graphs ⋮ Equitable partition of plane graphs with independent crossings into induced forests ⋮ Solution of problems of Kotzig and Grünbaum concerning the isolation of cycles in planar graphs ⋮ Entire choosability of near-outerplane graphs ⋮ Facial rainbow coloring of plane graphs ⋮ A general upper bound for the cyclic chromatic number of 3‐connected plane graphs ⋮ Optimal 1-planar graphs which triangulate other surfaces ⋮ Acyclic \(k\)-strong coloring of maps on surfaces ⋮ Beyond Planar Graphs: Introduction ⋮ Quantitative Restrictions on Crossing Patterns ⋮ Algorithms for 1-Planar Graphs ⋮ Edge Partitions and Visibility Representations of 1-planar Graphs ⋮ $$\textit{\textbf{k}}$$-Planar Graphs ⋮ Coloring a set of touching strings ⋮ On cyclic colorings and their generalizations ⋮ A new bound on the cyclic chromatic number ⋮ Coloring the faces of convex polyhedra so that like colors are far apart ⋮ From light edges to strong edge-colouring of 1-planar graphs ⋮ Counting cliques in 1-planar graphs ⋮ On total colorings of 1-planar graphs ⋮ 1-planar graphs without 4-cycles or 5-cycles are 5-colorable ⋮ Simultaneous coloring of edges and faces of plane graphs ⋮ All subgraphs of a wheel are 5-coupled-choosable
This page was built for publication:
