\(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs (Q436601): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Approximations for  -Colorings of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The algorithmic use of hypertree structure and maximum neighbourhood orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the L(h,k)-Labeling of Co-comparability Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The $L(2,1)$-Labeling Problem on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter complexity of \(\lambda\)-labelings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelling Graphs with a Condition at Distance 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579493 / rank
 
Normal rank
Property / cites work
 
Property / cites work: $L(2,1)$-Labeling of Hamiltonian graphs with Maximum Degree 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem about the Channel Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(L(2,1)\)-labeling of perfect elimination bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling Chordal Graphs: Distance Two Condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on labeling graphs with a condition at distance two / rank
 
Normal rank

Latest revision as of 12:37, 5 July 2024

scientific article
Language Label Description Also known as
English
\(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs
scientific article

    Statements

    \(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs (English)
    0 references
    0 references
    0 references
    25 July 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    \(L(2, 1)\)-labeling
    0 references
    strongly orderable graphs
    0 references
    dually chordal graphs
    0 references
    chordal bipartite graphs
    0 references
    graph algorithms
    0 references
    approximation algorithms
    0 references
    0 references