Monochromatic connectivity and graph products (Q2798325): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Reliable broadcasting in product networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erdős-Gallai-type results for colorful monochromatic connectivity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Independent Sets in a Grid Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rainbow connectivity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow trees in graphs and generalized connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multi-tree approach to reliability in distributed networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum broadcasting and personalized communication in hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connections of graphs: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path-connectivity of lexicographic product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small cycle double covers of products I: Lexicographic product with paths and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity of Cartesian products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2931463 / rank
 
Normal rank

Latest revision as of 19:17, 11 July 2024

scientific article
Language Label Description Also known as
English
Monochromatic connectivity and graph products
scientific article

    Statements

    Monochromatic connectivity and graph products (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 April 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    monochromatic path
    0 references
    monochromatic connection
    0 references
    graph products
    0 references
    0 references