L(2,1)-labeling of dually chordal graphs and strongly orderable graphs
DOI10.1016/J.IPL.2012.04.003zbMATH Open1243.05213OpenAlexW2068516066MaRDI QIDQ436601FDOQ436601
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
Recommendations
- Dually and strongly chordal graphs
- scientific article; zbMATH DE number 1743760
- Dual-chordal and strongly dual-chordal graphs
- scientific article; zbMATH DE number 2073985
- On \(L(d,1)\)-labelings of graphs
- \(L(2,1)\)-labeling of graphs: known results and open problems
- scientific article; zbMATH DE number 5812224
- On \(L(2 , 1)\)-labelings of oriented graphs
- Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs
- The \(L(2,1)\)-\({\mathcal F}\)-labeling problem of graphs
approximation algorithmsgraph algorithmsdually chordal graphschordal bipartite graphs\(L(2, 1)\)-labelingstrongly orderable graphs
Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Labelling Graphs with a Condition at Distance 2
- Characterizations of strongly chordal graphs
- The algorithmic use of hypertree structure and maximum neighbourhood orderings
- A survey on labeling graphs with a condition at distance two
- Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs
- Approximations for -Colorings of Graphs
- The $L(2,1)$-Labeling Problem on Graphs
- Fixed-parameter complexity of \(\lambda\)-labelings
- Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs
- Labeling Chordal Graphs: Distance Two Condition
- A Theorem about the Channel Assignment Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the L(h,k)-Labeling of Co-comparability Graphs
- $L(2,1)$-Labeling of Hamiltonian graphs with Maximum Degree 3
- \(L(2,1)\)-labeling of perfect elimination bipartite graphs
Cited In (9)
- \(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs
- L(3,1)-labeling of circulant graphs
- Title not available (Why is that?)
- Computing a minimum paired-dominating set in strongly orderable graphs
- Structural Information and Communication Complexity
- \(L(2, 1)\)-labeling of circulant graphs
- \(L(2,1)\)-labeling of interval graphs
- On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
- Coloring squares of graphs via vertex orderings
This page was built for publication: \(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436601)
