\(L(p,q)\)-labelling of \(K_{4}\)-minor free graphs (Q844189): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1016/j.ipl.2006.02.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2070712064 / 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: Topology of series-parallel networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3576665 / 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: Coloring the square of a \(K_{4}\)-minor free 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: A bound on the chromatic number of the square of a planar graph / 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: Q3070238 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:00, 2 July 2024

scientific article
Language Label Description Also known as
English
\(L(p,q)\)-labelling of \(K_{4}\)-minor free graphs
scientific article

    Statements

    \(L(p,q)\)-labelling of \(K_{4}\)-minor free graphs (English)
    0 references
    0 references
    0 references
    18 January 2010
    0 references
    channel assignment
    0 references
    \(L(p)\)-labelling
    0 references
    \(K_4\)-minor free graph
    0 references
    distance
    0 references

    Identifiers