scientific article
From MaRDI portal
Publication:3699704
zbMath0578.05016MaRDI QIDQ3699704
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (20)
Hamiltonicity and generalised total colourings of planar graphs ⋮ Outer 1-planar graphs ⋮ Optimal-area visibility representations of outer-1-plane graphs ⋮ Recognizing IC-Planar and NIC-Planar Graphs ⋮ Drawing outer-1-planar graphs revisited ⋮ On the recognition of fan-planar and maximal outer-fan-planar graphs ⋮ Total coloring of outer-1-planar graphs with near-independent crossings ⋮ The edge chromatic number of outer-1-planar graphs ⋮ Recognizing optimal 1-planar graphs in linear time ⋮ 1-fan-bundle-planar drawings of graphs ⋮ A successful concept for measuring non-planarity of graphs: The crossing number. ⋮ Orthogonal and smooth orthogonal layouts of 1-planar graphs with low edge complexity ⋮ A linear-time algorithm for testing full outer-2-planarity ⋮ Joins of 1-planar graphs ⋮ A linear-time algorithm for testing outer-1-planarity ⋮ Light paths and edges in families of outer-1-planar graphs ⋮ List edge coloring of outer-1-planar graphs ⋮ Linear arboricity of outer-1-planar graphs ⋮ On list \(r\)-hued coloring of outer-1-planar graphs ⋮ The structure and the list 3-dynamic coloring of outer-1-planar graphs
This page was built for publication:
