Locally injective \(k\)-colourings of planar graphs
From MaRDI portal
Publication:400498
DOI10.1016/j.dam.2014.03.020zbMath1298.05124OpenAlexW1977871775WikidataQ114191526 ScholiaQ114191526MaRDI QIDQ400498
Jan Kratochvíl, Mark H. Siggers
Publication date: 22 August 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.03.020
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some bounds on the injective chromatic number of graphs
- The complexity of the \(L(p,q)\)-labeling problem for bipartite planar graphs of small degree
- On the complexity of \(H\)-colouring planar graphs
- Finite common coverings of graphs
- Regular codes in regular graphs are difficult
- Covering regular graphs
- On the injective chromatic number of graphs
- A bound on the chromatic number of the square of a planar graph
- List-Coloring Squares of Sparse Subcubic Graphs
- Planar Formulae and Their Uses
- Labelling Graphs with a Condition at Distance 2
- Graph labeling and radio channel assignment
- K4,4 ?e has no finite planar cover
- Coloring Powers of Planar Graphs
- Approximations for -Colorings of Graphs
- Partial covers of graphs
- Coloring the square of a planar graph
- Injective coloring of planar graphs
This page was built for publication: Locally injective \(k\)-colourings of planar graphs
