On two conjectures about the proper connection number of graphs (Q2359964): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
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: Minimum degree conditions for the proper connection number 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: Minimum degree condition for proper connection number 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper connection numbers of complementary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connections of graphs: a survey / 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: Q3808121 / rank
 
Normal rank

Latest revision as of 00:16, 14 July 2024

scientific article
Language Label Description Also known as
English
On two conjectures about the proper connection number of graphs
scientific article

    Statements

    On two conjectures about the proper connection number of graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    23 June 2017
    0 references
    proper connection number
    0 references
    proper-path coloring
    0 references
    2-connected graph
    0 references
    3-edge-connected graph
    0 references
    diameter
    0 references

    Identifiers

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