No-hole L(2,1)-colorings
From MaRDI portal
Publication:1408461
DOI10.1016/S0166-218X(03)00329-9zbMATH Open1032.05046OpenAlexW2070118295MaRDI QIDQ1408461FDOQ1408461
Authors: Peter Fishburn, Fred Roberts 
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
Recommendations
Cites Work
- 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
- The $L(2,1)$-Labeling Problem on Graphs
- On the $\lambda$-Number of $Q_n $ and Related Graphs
- Title not available (Why is that?)
- Labeling Chordal Graphs: Distance Two Condition
- Title not available (Why is that?)
- No-hole 2-distant colorings
- No-hole \((r+1)\)-distant colorings
Cited In (35)
- On irreducible no-hole \(L(2, 1)\)-labelings of hypercubes and triangular lattices
- Some classes of trees with maximum number of holes two
- Path covering number and \(L(2,1)\)-labeling number of graphs
- A note on the \(L (2, 1)\)-labelling problem of \(\mathcal{G} (k, m)\)
- On island sequences of labelings with a condition at distance two
- Solutions of some \(L(2, 1)\)-coloring related open problems
- Infinitely many trees with maximum number of holes zero, one, and two
- The \(\Delta ^{2}\)-conjecture for \(L(2,1)\)-labelings is true for total graphs
- On critical trees labeled with a condition at distance two
- Holes in \(L(2,1)\)-coloring on certain classes of graphs
- Pair \(L(2, 1)\)-labelings of infinite graphs
- Title not available (Why is that?)
- A note on collections of graphs with non-surjective lambda labelings
- Extremal problems on consecutive \(L(2,1)\)-labelling
- An extremal problem on non-full colorable graphs
- L(2, 1)-coloring and irreducible no-hole coloring of lexicographic product of graphs
- Distance-two labelings of digraphs
- \(L(2,1)\)-labelings of Cartesian products of two cycles
- Further results on holes in \(L(2,1)\) coloring on certain classes of graphs
- On the hole index of \(L(2,1)\)-labelings of \(r\)-regular graphs
- On the universality and extremality of graphs with a distance constrained colouring
- A Frameless 2-Coloring of the Plane Lattice
- On relationship between Hamiltonian path and holes in \(L(3, 2, 1)\)-coloring of minimum span
- Radio graceful Hamming graphs
- Obituary: Peter C. Fishburn (1936--2021)
- No-hole \(k\)-tuple \((r+1)\)-distant colorings
- Hole: An Emerging Character in the Story of Radio k-Coloring Problem
- A survey on labeling graphs with a condition at distance two
- \(L(2,1)\)-colorings and irreducible no-hole colorings of the direct product of graphs
- On irreducible no-hole \(L(2, 1)\)-coloring of Cartesian product of trees with paths
- Full Color Theorems for L(2,1)-Colorings
- \(L(2,1)\)-colorings and irreducible no-hole colorings of Cartesian product of graphs
- Irreducible no-hole \(L(2, 1)\)-coloring of edge-multiplicity-paths-replacement graph
- No-hole \(k\)-tuple \((r+1)\)-distant colorings of odd cycles
- On irreducible no-hole \(L(2,1)\)-coloring of subdivision of graphs
This page was built for publication: No-hole \(L(2,1)\)-colorings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1408461)
