Some results on the injective chromatic number of graphs (Q1928520): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Injective coloring 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: Some bounds on the injective chromatic number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology of series-parallel networks / 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: On the injective chromatic number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579493 / 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: Coloring the square of a \(K_{4}\)-minor free graph / rank
 
Normal rank

Latest revision as of 01:04, 6 July 2024

scientific article
Language Label Description Also known as
English
Some results on the injective chromatic number of graphs
scientific article

    Statements

    Some results on the injective chromatic number of graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    3 January 2013
    0 references
    injective coloring
    0 references
    \(K_{4}\)-minor free graph
    0 references
    planar graph
    0 references
    maximum degree
    0 references

    Identifiers