Labeling Chordal Graphs: Distance Two Condition

DOI10.1137/S0895480191223178zbMath0794.05118OpenAlexW2074820146MaRDI QIDQ4287946

Publication date: 12 May 1994

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480191223178

zbMATH Keywords

upper bounds distance chromatic number chordal graph unit interval graphs $L(2,1)$-labeling number

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (69)

$L(p,q)$ labeling of $d$-dimensional grids ⋮ $L(2, 1)$-labeling of circulant graphs ⋮ The 2-dipath chromatic number of Halin graphs ⋮ L(3,1)-labeling of circulant graphs ⋮ On Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations ⋮ $\lambda$-coloring matrogenic graphs ⋮ The $L(2,1)$-labeling on planar graphs ⋮ Distance-two labelings of digraphs ⋮ Backbone coloring for graphs with large girths ⋮ $L(3, 2, 1)$- and $L(4, 3, 2, 1)$-labeling problems on interval graphs ⋮ Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers ⋮ No-hole $L(2,1)$-colorings ⋮ On backbone coloring of graphs ⋮ $L(2,1)$-labeling of dually chordal graphs and strongly orderable graphs ⋮ Radio number for total graph of paths ⋮ $L(2,1)$-labeling of perfect elimination bipartite graphs ⋮ List backbone colouring of graphs ⋮ The $L(2,1)$-labelling problem for cubic Cayley graphs on dihedral groups ⋮ Path covering number and $L(2,1)$-labeling number of graphs ⋮ Improved upper bounds on the $L(2,1)$-labeling of the skew and converse skew product graphs ⋮ Distance two labelling and direct products of graphs ⋮ Distance-constrained labellings of Cartesian products of graphs ⋮ Labeling planar graphs with a condition at distance two ⋮ $(2,1)$-total labelling of outerplanar graphs ⋮ The $L(2,1)$-labeling on the skew and converse skew products of graphs ⋮ $L(1,1)$-labelling of the direct product of a complete graph and a cycle ⋮ $L(2,1)$-labeling of interval graphs ⋮ Labelling planar graphs without 4-cycles with a condition on distance two ⋮ Radio number for trees ⋮ $L (j, k)$- and circular $L(j, k)$-labellings for the products of complete graphs ⋮ $L(2,1)$-labeling of Kneser graphs and coloring squares of Kneser graphs ⋮ The $L(2,1)$-labeling on Cartesian sum of graphs ⋮ The $L(2,1)$-labeling on graphs and the frequency assignment problem ⋮ On the $L(p,1)$-labelling of graphs ⋮ Nordhaus-Gaddum-type results for path covering and $L(2,1)$-labeling numbers ⋮ New upper bounds on the $L(2,1)$-labeling of the skew and converse skew product graphs ⋮ Distance constrained labelings of planar graphs with no short cycles ⋮ Graph labellings with variable weights, a survey ⋮ Labeling the $r$-path with a condition at distance two ⋮ $L(j,k)$-labelling and maximum ordering-degrees for trees ⋮ $L(2,1)$-labeling of direct product of paths and cycles ⋮ 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 ⋮ The $L(2,1)$-labelling of trees ⋮ $L(2,1)$-labelings of Cartesian products of two cycles ⋮ On critical trees labeled with a condition at distance two ⋮ Generalized list $T$-colorings of cycles ⋮ $L(2, 1)$-labeling of permutation and bipartite permutation graphs ⋮ A survey on labeling graphs with a condition at distance two ⋮ Fixed-parameter complexity of $\lambda$-labelings ⋮ On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs ⋮ $L(2,1)$-labelings on the composition of $n$ graphs ⋮ Unnamed Item ⋮ The $L(2,1)$-labeling of unigraphs ⋮ L(1,1)-Labeling of direct product of cycles ⋮ The $L(2,1)$-labeling of $K_{1,n}$-free graphs and its applications ⋮ On $L(d,1)$-labeling of Cartesian product of a cycle and a path ⋮ Linear and cyclic distance-three labellings of trees ⋮ Labeling trees with a condition at distance two ⋮ Distance-two labellings of Hamming graphs ⋮ $\mathcal{U}$-bubble model for mixed unit interval graphs and its applications: the MaxCut problem revisited ⋮ On $L(2,1)$-labelings of Cartesian products of paths and cycles ⋮ Some results on distance two labelling of outerplanar graphs ⋮ Distance constrained labelings of $K_{4}$-minor free graphs ⋮ Irreducibility of L(2, 1)-coloring and Inh-Colorability of Some Classes of Graphs ⋮ Distance Constrained Labelings of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>K</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:math>-minor Free Graphs ⋮ Radio number for the product of a path and a complete graph ⋮ Distance-two labelings of graphs ⋮ List version of $L(d,s)$-labelings

This page was built for publication: Labeling Chordal Graphs: Distance Two Condition