Rainbow vertex-connection and graph products (Q5739599): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/00207160.2015.1047356 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1796130836 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex sets in lexicographic products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliable broadcasting in product networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection number of graph power and graph products / 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: Hardness and Algorithms for Rainbow Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rainbow connectivity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of determining the rainbow vertex-connection of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the connectivity of Kronecker products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3005852 / 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: Isomorphic components of Kronecker product of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the rainbow connection of Cartesian products and their subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE EDGE-CONNECTIVITY OF CARTESIAN PRODUCT GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the number of edges in edge-chromatic-critical graphs with fixed maximum degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the rainbow vertex-connection / 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: Rainbow Connection in Graphs with Minimum Degree Three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the rainbow connection number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity of strong products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Game coloring the Cartesian product of graphs / rank
 
Normal rank

Latest revision as of 07:16, 12 July 2024

scientific article; zbMATH DE number 6604258
Language Label Description Also known as
English
Rainbow vertex-connection and graph products
scientific article; zbMATH DE number 6604258

    Statements

    Rainbow vertex-connection and graph products (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 July 2016
    0 references
    vertex-colouring
    0 references
    rainbow vertex-connection number
    0 references
    direct product
    0 references
    lexicographic product
    0 references
    Cartesian product
    0 references
    strong product
    0 references

    Identifiers