Chromatic number, independence ratio, and crossing number
From MaRDI portal
Publication:3535837
DOI10.26493/1855-3974.10.2d0zbMath1181.05032OpenAlexW1914506312WikidataQ129353446 ScholiaQ129353446MaRDI QIDQ3535837
Publication date: 14 November 2008
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.26493/1855-3974.10.2d0
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (34)
Recognizing and drawing IC-planar graphs ⋮ Adjacent vertex distinguishing edge coloring of IC-planar graphs ⋮ Neighbor sum distinguishing list total coloring of IC-planar graphs without 5-cycles ⋮ Recognizing IC-Planar and NIC-Planar Graphs ⋮ Fan-crossing free graphs and their relationship to other beyond-planar graphs ⋮ An annotated bibliography on 1-planarity ⋮ \((k,p)\)-planarity: a relaxation of hybrid planarity ⋮ \(\mathsf{NIC}\)-planar graphs ⋮ On morphing 1-planar drawings ⋮ Neighbor sum distinguishing total coloring of IC-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 ⋮ IC-planar graphs are odd-10-colorable ⋮ The linear 2-arboricity of IC-planar graphs ⋮ \(\mathsf{T}\)-shape visibility representations of 1-planar graphs ⋮ Neighbor sum distinguishing total coloring of sparse IC-planar graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity ⋮ Cyclic colorings of plane graphs with independent faces ⋮ On \((p, 1)\)-total labelling of NIC-planar graphs ⋮ Neighbor sum distinguishing total coloring of triangle free IC-planar graphs ⋮ Acyclic edge coloring of IC-planar graphs ⋮ Unnamed Item ⋮ Coloring plane graphs with independent crossings ⋮ Neighbor sum distinguishing total choosability of IC-planar graphs ⋮ Remarks on the joins of 1-planar graphs ⋮ Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13 ⋮ The maximal 1-planarity and crossing numbers of graphs ⋮ Linear arboricity of NIC-planar graphs ⋮ A sufficient condition for an IC-planar graph to be class 1 ⋮ Equitable partition of plane graphs with independent crossings into induced forests ⋮ Acyclic coloring of IC-planar graphs ⋮ IC-Planar Graphs Are 6-Choosable
This page was built for publication: Chromatic number, independence ratio, and crossing number
