\(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs

DOI10.1016/J.IPL.2012.04.003zbMath1243.05213OpenAlexW2068516066MaRDI QIDQ436601

B. S. Panda, Preeti Goel

Publication date: 25 July 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.04.003

zbMATH Keywords

graph algorithmsapproximation algorithmsdually chordal graphschordal bipartite graphs\(L(2, 1)\)-labelingstrongly orderable graphs

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (6)

\(L(2, 1)\)-labeling of circulant graphs ⋮ Computing a minimum paired-dominating set in strongly orderable graphs ⋮ L(3,1)-labeling of circulant graphs ⋮ \(L(2,1)\)-labeling of interval graphs ⋮ Coloring squares of graphs via vertex orderings ⋮ \(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• \(L(2,1)\)-labeling of perfect elimination bipartite graphs
• Characterizations of strongly chordal graphs
• The algorithmic use of hypertree structure and maximum neighbourhood orderings
• Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs
• A survey on labeling graphs with a condition at distance two
• On the L(h,k)-Labeling of Co-comparability Graphs
• $L(2,1)$-Labeling of Hamiltonian graphs with Maximum Degree 3
• Labelling Graphs with a Condition at Distance 2
• Labeling Chordal Graphs: Distance Two Condition
• A Theorem about the Channel Assignment Problem
• Approximations for  -Colorings of Graphs
• The $L(2,1)$-Labeling Problem on Graphs
• Fixed-parameter complexity of \(\lambda\)-labelings

This page was built for publication: \(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs