Vertex colourings of multigraphs with forbiddances on edges

DOI10.33048/semi.2020.17.042zbMath1440.05087OpenAlexW3018075661MaRDI QIDQ2182245

Konstantin Alekseevich Khadaev, Ivan Alekseevich Pavlov, Alekseĭ Nikolaevich Glebov

Publication date: 21 May 2020

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.33048/semi.2020.17.042

zbMATH Keywords

multigraphcolouringedgelist colouringforbiddance

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Every planar graph is 5-choosable
• The list chromatic index of a bipartite multigraph
• Brooks-Type Theorems for Pair-List Colorings and List Homomorphisms

This page was built for publication: Vertex colourings of multigraphs with forbiddances on edges