Minimum degree and size conditions for the proper connection number of graphs (Q2010690): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Proper connection and size of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On proper-path colorings in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper connection of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal paths and circuits of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two conjectures about the proper connection number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection in sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with rainbow connection number two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow vertex connection of digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total rainbow connection of digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection number of dense 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: Note on Hamilton Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow Connection in Graphs with Minimum Degree Three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal circuits of graphs. I / rank
 
Normal rank

Revision as of 02:52, 21 July 2024

scientific article
Language Label Description Also known as
English
Minimum degree and size conditions for the proper connection number of graphs
scientific article

    Statements

    Minimum degree and size conditions for the proper connection number of graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 November 2019
    0 references
    proper connection number
    0 references
    minimum degree
    0 references
    edge number
    0 references

    Identifiers