Connectivity of minimum non-5-injectively colorable planar cubic graphs (Q2176826): 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/s40305-018-0214-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2886427884 / 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: On Injective Colourings of Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of injective colorings and its generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Injective coloring of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Injective colorings of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Injective colorings of graphs with low average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Injective coloring of planar graphs with girth 6 / 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: List injective colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List injective coloring of planar graphs with girth 5, 6, 8 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two smaller upper bounds of List injective chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Injective choosability of planar graphs of girth five and six / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on the injective chromatic number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counterexamples to a conjecture on injective colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The square of a planar cubic graph is 7-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: List-coloring the square of a subcubic graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Injective colorings of planar graphs with few colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank

Latest revision as of 14:02, 22 July 2024

scientific article
Language Label Description Also known as
English
Connectivity of minimum non-5-injectively colorable planar cubic graphs
scientific article

    Statements

    Connectivity of minimum non-5-injectively colorable planar cubic graphs (English)
    0 references
    0 references
    0 references
    5 May 2020
    0 references
    planar cubic graphs
    0 references
    connectivity
    0 references
    3-connected graph
    0 references
    injective coloring
    0 references

    Identifiers