scientific article; zbMATH DE number 790475

MaRDI QIDQ4846547zbMATH OpenFDO

Authors Oleg V. Borodin, Douglas R. Woodall

Publication date 27 August 1995

zbMATH Keywords

colouring numbersplane and outerplane graphssurveyunsolved problems

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited in

(15)

• Entire choosability of near-outerplane graphs
• Choosability, edge choosability and total choosability of outerplane graphs
• The clique-perfectness and clique-coloring of outer-planar graphs
• The \(r\)-acyclic chromatic number of planar graphs
• On group choosability of total graphs
• Clique-transversal sets and clique-coloring in planar graphs
• Labelling of some planar graphs with a condition at distance two
• The entire coloring of series-parallel graphs
• Edge coloring by total labelings of outerplanar graphs
• Equitable vertex arboricity of graphs
• On \(r\)-acyclic edge colorings of planar graphs
• Facial parity edge colouring of plane pseudographs
• Edge-group choosability of outerplanar and near-outerplanar graphs
• Equitable and equitable list colorings of graphs
• Odd coloring of 2-boundary planar graphs and beyond

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4846547)