A note on polychromatic colorings of plane graphs
From MaRDI portal
Publication:5866030
DOI10.1142/S1793830921501287zbMath1487.05101OpenAlexW3154514037MaRDI QIDQ5866030
Xinmiao Zhang, Xia Zhang, Yirong Guo
Publication date: 10 June 2022
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830921501287
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Some class 1 graphs on \(g_c\)-colorings
- Polychromatic 4-coloring of cubic bipartite plane graphs
- Guarding polyhedral terrains
- Edge covered critical multigraphs
- The Grötzsch theorem for the hypergraph of maximal cliques
- A sufficient condition for equitable edge-colourings of simple graphs
- Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces
- Disconnected \(g_c\)-critical graphs
- Equitable edge-colorings of simple graphs
- Polychromatic colorings of bounded degree plane graphs
- On decompositions of a multi-graph into spanning subgraphs
- On the chromatic index and the cover index of a multigraph
- On $g_c$-colorings of nearly bipartite graphs
- Polychromatic colorings of plane graphs
This page was built for publication: A note on polychromatic colorings of plane graphs
