L(2,1)-labeling of dually chordal graphs and strongly orderable graphs
From MaRDI portal
(Redirected from Publication:436601)
\(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs
\(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs
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
Cites work
- scientific article; zbMATH DE number 5764899 (Why is no real title available?)
- scientific article; zbMATH DE number 2086689 (Why is no real title available?)
- $L(2,1)$-Labeling of Hamiltonian graphs with Maximum Degree 3
- A Theorem about the Channel Assignment Problem
- 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
- Characterizations of strongly chordal graphs
- Fixed-parameter complexity of \(\lambda\)-labelings
- Labeling Chordal Graphs: Distance Two Condition
- Labelling Graphs with a Condition at Distance 2
- On the L(h,k)-Labeling of Co-comparability Graphs
- Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs
- The $L(2,1)$-Labeling Problem on Graphs
- The algorithmic use of hypertree structure and maximum neighbourhood orderings
- L(2,1)-labeling of perfect elimination bipartite graphs
Cited in
(13)- On \(L(2,1)\)-coloring split, chordal bipartite, and weakly chordal graphs
- \(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs
- scientific article; zbMATH DE number 1743760 (Why is no real title available?)
- Computing a minimum paired-dominating set in strongly orderable graphs
- L(2,1)-labeling of perfect elimination bipartite graphs
- Structural Information and Communication Complexity
- \(L(2, 1)\)-labeling of circulant graphs
- \(L(2,1)\)-labeling of block graphs.
- \(L(3,1)\)-labeling of circulant graphs
- L(2,1)-labeling of interval graphs
- On \(\lambda \)-coloring split, chordal bipartite and weakly chordal 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)
