Note on directed proper connection number of a random graph (Q2279590): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q2829346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper connection of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4836076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3786318 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian circuits determining the order of chromosomes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the (di)graphs with (directed) proper connection number two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the strength of connectedness of a random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random 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: The Strength of Connectivity of a Random Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The transitive closure of a random digraph / 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: Characterizations of graphs having large proper connection numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properly Colored Connectivity of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: General percolation and random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5279726 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5646917 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Probability of Connectedness of a Random Graph $\mathcal{G}_m (t)$ / rank
 
Normal rank

Revision as of 05:58, 21 July 2024

scientific article
Language Label Description Also known as
English
Note on directed proper connection number of a random graph
scientific article

    Statements

    Note on directed proper connection number of a random graph (English)
    0 references
    0 references
    0 references
    0 references
    13 December 2019
    0 references
    directed proper connection number
    0 references
    directed graphs
    0 references
    random graphs
    0 references

    Identifiers

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