No-hole \(L(2,1)\)-colorings
From MaRDI portal
Publication:1408461
DOI10.1016/S0166-218X(03)00329-9zbMath1032.05046OpenAlexW2070118295MaRDI QIDQ1408461
Fred S. Roberts, Peter C. Fishburn
Publication date: 22 September 2003
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(03)00329-9
Related Items (27)
Solutions of some \(L(2, 1)\)-coloring related open problems ⋮ Extremal problems on consecutive \(L(2,1)\)-labelling ⋮ Pair \(L(2, 1)\)-labelings of infinite graphs ⋮ An extremal problem on non-full colorable graphs ⋮ Hole: An Emerging Character in the Story of Radio k-Coloring Problem ⋮ Radio graceful Hamming graphs ⋮ Distance-two labelings of digraphs ⋮ \(L(2,1)\)-colorings and irreducible no-hole colorings of the direct product of graphs ⋮ \(L(2,1)\)-colorings and irreducible no-hole colorings of Cartesian product of graphs ⋮ L(2, 1)-coloring and irreducible no-hole coloring of lexicographic product of graphs ⋮ On the universality and extremality of graphs with a distance constrained colouring ⋮ Irreducible no-hole \(L(2, 1)\)-coloring of edge-multiplicity-paths-replacement graph ⋮ Path covering number and \(L(2,1)\)-labeling number of graphs ⋮ On the hole index of \(L(2,1)\)-labelings of \(r\)-regular graphs ⋮ Infinitely many trees with maximum number of holes zero, one, and two ⋮ On island sequences of labelings with a condition at distance two ⋮ A note on collections of graphs with non-surjective lambda labelings ⋮ The \(\Delta ^{2}\)-conjecture for \(L(2,1)\)-labelings is true for total graphs ⋮ On irreducible no-hole \(L(2,1)\)-coloring of subdivision of graphs ⋮ \(L(2,1)\)-labelings of Cartesian products of two cycles ⋮ On critical trees labeled with a condition at distance two ⋮ A survey on labeling graphs with a condition at distance two ⋮ On relationship between Hamiltonian path and holes in \(L(3, 2, 1)\)-coloring of minimum span ⋮ On Irreducible No-hole L(2, 1)-labelings of Hypercubes and Triangular Lattices ⋮ On irreducible no-hole L(2, 1)-coloring of Cartesian product of trees with paths ⋮ Obituary: Peter C. Fishburn (1936--2021) ⋮ A note on the \(L (2, 1)\)-labelling problem of \(\mathcal{G} (k, m)\)
Cites Work
- Unnamed Item
- Unnamed Item
- No-hole \((r+1)\)-distant colorings
- No-hole 2-distant colorings
- Relating path coverings to vertex labellings with a condition at distance two
- Full Color Theorems for L(2,1)-Colorings
- Labelling Graphs with a Condition at Distance 2
- Labeling Chordal Graphs: Distance Two Condition
- On the $\lambda$-Number of $Q_n $ and Related Graphs
- The $L(2,1)$-Labeling Problem on Graphs
This page was built for publication: No-hole \(L(2,1)\)-colorings
