Ein Sechsfarbenproblem auf der Kugel
From MaRDI portal
Publication:2395454
DOI10.1007/BF02996313zbMath0132.20701OpenAlexW2083421046WikidataQ57255591 ScholiaQ57255591MaRDI QIDQ2395454
Publication date: 1965
Published in: Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02996313
Related Items (only showing first 100 items - show all)
Neighbor sum distinguishing total choice number of NIC-planar graphs with restricted conditions ⋮ On the Size of Matchings in 1-Planar Graph with High Minimum Degree ⋮ Contact Representations of Graphs in 3D ⋮ Recognizing IC-Planar and NIC-Planar Graphs ⋮ Packing Trees into 1-planar Graphs ⋮ Properties of Large 2-Crossing-Critical Graphs ⋮ 1-planar graphs are odd 13-colorable ⋮ Light edges in 1‐planar graphs ⋮ Matchings in 1‐planar graphs with large minimum degree ⋮ Book embeddings of \(k\)-framed graphs and \(k\)-map graphs ⋮ All 2-planar graphs having the same spanning subgraph ⋮ On the edge-connectivity and restricted edge-connectivity of optimal 1-planar graphs ⋮ The family of fan-planar graphs ⋮ The maximum matching extendability and factor-criticality of 1-planar graphs ⋮ An improvement of the bound on the odd chromatic number of 1-planar graphs ⋮ On list \((p, 1)\)-total labellings of special planar graphs and 1-planar graphs ⋮ 1-planar graphs with girth at least 6 are (1,1,1,1)-colorable ⋮ Acyclic edge coloring of 1-planar graphs without 4-cycles ⋮ Weak-dynamic coloring of graphs beyond-planarity ⋮ IC-planar graphs are odd-10-colorable ⋮ Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23 ⋮ Optimal 1-planar multigraphs ⋮ A new note on 1-planar graphs with minimum degree 7 ⋮ The entire chromatic number of a normal graph is at most seven ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Beyond Outerplanarity ⋮ Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity ⋮ Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles ⋮ Unnamed Item ⋮ Research problems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Coloring plane graphs with independent crossings ⋮ Unnamed Item ⋮ Acyclic colouring of 1-planar graphs ⋮ On RAC drawings of graphs with one bend per edge ⋮ Compact drawings of 1-planar graphs with right-angle crossings and few bends ⋮ On RAC drawings of graphs with one bend per edge ⋮ Graph theory ⋮ Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing ⋮ On Aligned Bar 1-Visibility Graphs ⋮ Note on improper coloring of $1$-planar graphs ⋮ Quantitative Restrictions on Crossing Patterns ⋮ 1-Planar Graphs ⋮ Algorithms for 1-Planar Graphs ⋮ $$\textit{\textbf{k}}$$-Planar Graphs ⋮ Fan-Planar Graphs ⋮ IC-Planar Graphs Are 6-Choosable ⋮ Simple Topological Drawings of k-Planar Graphs ⋮ 2-Layer k-Planar Graphs ⋮ From light edges to strong edge-colouring of 1-planar graphs ⋮ Edge-pancyclicity of coupled graphs ⋮ Total coloring of 1-toroidal graphs with maximum degree at least 11 and no adjacent triangles ⋮ The density of fan-planar graphs ⋮ Hamiltonicity and generalised total colourings of planar graphs ⋮ Graph polynomials and paintability of plane graphs ⋮ Outer 1-planar graphs ⋮ Recognizing and drawing IC-planar graphs ⋮ Simultaneously colouring the edges and faces of plane graphs ⋮ On the \(d\)-distance face chromatic number of plane graphs ⋮ Recognizing and embedding simple optimal 2-planar graphs ⋮ On fan-crossing and fan-crossing free graphs ⋮ On edge colorings of 1-toroidal graphs ⋮ The structure of 1-planar graphs ⋮ Der Satz von Kuratowski und eine ähnliche Fragestellung ⋮ \(K_7\)-minors in optimal 1-planar graphs ⋮ On total colorings of some special 1-planar graphs ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ On RAC drawings of 1-planar graphs ⋮ Dynamic list coloring of 1-planar graphs ⋮ Entire coloring of 2-connected plane graphs ⋮ An annotated bibliography on 1-planarity ⋮ On the recognition of fan-planar and maximal outer-fan-planar graphs ⋮ Acyclic chromatic index of triangle-free 1-planar graphs ⋮ On the equitable edge-coloring of 1-planar graphs and planar graphs ⋮ \(\mathsf{NIC}\)-planar graphs ⋮ A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system ⋮ On morphing 1-planar drawings ⋮ Proper 1-immersions of graphs triangulating the plane ⋮ Plane graphs with \(\Delta = 7\) are entirely 10-colorable ⋮ On drawings and decompositions of 1-planar graphs ⋮ A note on 1-planar graphs ⋮ The structure of plane graphs with independent crossings and its applications to coloring problems ⋮ An improved upper bound for the acyclic chromatic number 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 ⋮ Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time ⋮ On the Density of Non-simple 3-Planar Graphs ⋮ On edge colorings of \(1\)-planar graphs ⋮ On Hamiltonian alternating cycles and paths ⋮ On fan-crossing graphs ⋮ Recognizing optimal 1-planar graphs in linear time ⋮ \(\mathsf{T}\)-shape visibility representations of 1-planar graphs ⋮ Efficient generation of different topological representations of graphs beyond-planarity ⋮ 1-fan-bundle-planar drawings of graphs ⋮ Edge covering pseudo-outerplanar graphs with forests ⋮ On edge colorings of 1-planar graphs without 5-cycles with two chords
This page was built for publication: Ein Sechsfarbenproblem auf der Kugel
