Minimum degree condition for proper connection number 2 (Q2424876): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Xue Liang Li / rank
Normal rank
 
Property / author
 
Property / author: Xue Liang Li / rank
 
Normal rank
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.tcs.2016.04.042 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2414388691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2829346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper connection of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper connection number of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper connection numbers of complementary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper connection number and connected dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connections of graphs: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Panconnected graphs. II / rank
 
Normal rank

Latest revision as of 16:16, 19 July 2024

scientific article
Language Label Description Also known as
English
Minimum degree condition for proper connection number 2
scientific article

    Statements

    Minimum degree condition for proper connection number 2 (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 June 2019
    0 references
    proper connection number
    0 references
    proper-path coloring
    0 references
    bridge-block tree
    0 references
    minimum degree
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references