scientific article
From MaRDI portal
Publication:3579493
zbMath1192.05135MaRDI QIDQ3579493
Frédéric Havet, Jean-Sébastien Sereni, Bruce A. Reed
Publication date: 6 August 2010
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (25)
\(L(2, 1)\)-labeling of circulant graphs ⋮ L(3,1)-labeling of circulant graphs ⋮ \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\) ⋮ \(L(2,1)\)-colorings and irreducible no-hole colorings of the direct product of graphs ⋮ Some results on the injective chromatic number of graphs ⋮ On \(L(2,1)\)-labeling of generalized Petersen graphs ⋮ Fast exact algorithm for \(L(2,1)\)-labeling of graphs ⋮ Weighted improper colouring ⋮ Exact \(\lambda\)-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips ⋮ \(L(2,1)\)-labelling of generalized prisms ⋮ Exact algorithms for \(L(2,1)\)-labeling of graphs ⋮ On radio \(k\)-labeling of the power of the infinite path ⋮ A linear algorithm for radio \(k\)-coloring powers of paths having small diameter ⋮ \(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs ⋮ \(L(2,1)\)-labeling of perfect elimination bipartite graphs ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Determining the \(L(2,1)\)-span in polynomial space ⋮ On theL(2, 1)-labelling of block graphs ⋮ \(L(2,1)\)-labeling of interval graphs ⋮ Fast Exact Algorithm for L(2,1)-Labeling of Graphs ⋮ \(L(2, 1)\)-labelling of graphs with few \(P_4\)'s ⋮ Labeling the \(r\)-path with a condition at distance two ⋮ \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs ⋮ On \(L(2 , 1)\)-labelings of oriented graphs ⋮ Distance constrained labelings of \(K_{4}\)-minor free graphs
This page was built for publication:
