Labeling Chordal Graphs: Distance Two Condition

DOI10.1137/S0895480191223178zbMATH Open0794.05118OpenAlexW2074820146MaRDI QIDQ4287946FDOQ4287946

Authors: Denise Sakai

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

Recommendations

On $L(d,1)$-labelings of graphs
On distance two labelling of unit interval graphs
The $L(2,1)$-Labeling Problem on Graphs
scientific article; zbMATH DE number 2145257

zbMATH Keywords

distance chromatic number upper bounds 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)

Cited In (72)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4287946)