Some results on distance two labelling of outerplanar graphs (Q1036889): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1007/s10255-006-6065-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1998771481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501549 / 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: On \(L(d,1)\)-labelings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling Products of Complete Graphs with a Condition at Distance Two / 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: Coloring the square of a planar graph / 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: Circular Distance Two Labeling and the $\lambda$-Number for Outerplanar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring the square of a \(K_{4}\)-minor free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound on the chromatic number of the square of a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling Chordal Graphs: Distance Two Condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choosability, edge choosability and total choosability of outerplane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling Planar Graphs with Conditions on Girth and Distance Two / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(L(2,1)\)-labelling of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3070238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the $\lambda$-Number of $Q_n $ and Related Graphs / rank
 
Normal rank

Latest revision as of 03:48, 2 July 2024

scientific article
Language Label Description Also known as
English
Some results on distance two labelling of outerplanar graphs
scientific article

    Statements

    Some results on distance two labelling of outerplanar graphs (English)
    0 references
    13 November 2009
    0 references
    \(L(2,1)\)-labelling
    0 references
    chromatic number
    0 references
    outerplanar graph
    0 references
    0 references
    0 references

    Identifiers