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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C78 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6059707 / rank
 
Normal rank
Property / zbMATH Keywords
 
\(L(2, 1)\)-labeling
Property / zbMATH Keywords: \(L(2, 1)\)-labeling / rank
 
Normal rank
Property / zbMATH Keywords
 
strongly orderable graphs
Property / zbMATH Keywords: strongly orderable graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
dually chordal graphs
Property / zbMATH Keywords: dually chordal graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
chordal bipartite graphs
Property / zbMATH Keywords: chordal bipartite graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
graph algorithms
Property / zbMATH Keywords: graph algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation algorithms
Property / zbMATH Keywords: approximation algorithms / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2012.04.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2068516066 / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

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