\(L(2,1)\)-labeling of perfect elimination bipartite graphs (Q643028): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Biconvex graphs: Ordering and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of totally balanced matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling bipartite permutation graphs with a condition at distance two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the <i>L</i>(<i>h</i>, <i>k</i>)‐labeling of co‐comparability graphs and circular‐arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(L(h,1)\)-labeling subclasses of planar 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: LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem / 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: Perfect Elimination and Chordal Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(L(p,1)\)-labelling of graphs / 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: A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS / 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: Bipartite permutation graphs with application to the minimum buffer size problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling Chordal Graphs: Distance Two Condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on labeling graphs with a condition at distance two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient parallel algorithms for doubly convex-bipartite graphs / rank
 
Normal rank

Revision as of 13:55, 4 July 2024

scientific article
Language Label Description Also known as
English
\(L(2,1)\)-labeling of perfect elimination bipartite graphs
scientific article

    Statements

    \(L(2,1)\)-labeling of perfect elimination bipartite graphs (English)
    0 references
    0 references
    0 references
    27 October 2011
    0 references
    \(L(2, 1)\)-labeling
    0 references
    perfect elimination bipartite graphs
    0 references
    graph algorithms
    0 references
    NP-complete
    0 references
    0 references
    0 references

    Identifiers