Vertex colourings of multigraphs with forbiddances on edges

DOI10.33048/SEMI.2020.17.042zbMATH Open1440.05087OpenAlexW3018075661MaRDI QIDQ2182245FDOQ2182245

Authors: Ivan Alekseevich Pavlov, Konstantin Alekseevich Khadaev, A. N. Glebov 

Publication date: 21 May 2020

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

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

Recommendations

• scientific article; zbMATH DE number 1146231
• On the fg-coloring of graphs
• Vertex colorings without rainbow or monochromatic subgraphs
• A generalization of edge-coloring in graphs
• List edge and list total colourings of multigraphs

zbMATH Keywords

multigraphcolouringedgelist colouringforbiddance

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Every planar graph is 5-choosable
• The list chromatic index of a bipartite multigraph
• Title not available (Why is that?)
• Brooks-Type Theorems for Pair-List Colorings and List Homomorphisms

Cited In (2)

• Interval vertex-coloring of a graph with forbidden colors
• The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques

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

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