scientific article; zbMATH DE number 1445362
From MaRDI portal
Recommendations
Cited in
(24)- List 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six
- Distance constrained labelings of \(K_{4}\)-minor free graphs
- 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)
- Coloring the square of a \(K_{4}\)-minor free graph
- Signature of power graphs
- On coloring numbers of graph powers
- Coloring squares of planar graphs with girth six
- Labeling planar graphs with a condition at distance two
- Radiocoloring in planar graphs: Complexity and approximations
- Coloring powers and girth
- A linear time algorithm to compute square of interval graphs and their colouring
- Coloring Powers of Planar Graphs
- scientific article; zbMATH DE number 6849640 (Why is no real title available?)
- Coloring the square of a planar graph
- WORM colorings of planar graphs
- Coloring Powers of Chordal Graphs
- On some parameters related to matching of graph powers
- List injective colorings of planar graphs
- Algebraic bounds for the independence and chromatic number of graph powers
- List injective coloring of planar graphs with girth g 6
- Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies
- Labelling planar graphs without 4-cycles with a condition on distance two
- On colorings of graph fractional powers
- Chromatic sets of power graphs and their application to resource placement in multicomputer networks
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 Q4952682)
