Probabilistic methods for decomposition dimension of graphs

DOI10.1007/S00373-003-0526-ZMaRDI QIDQ1423494zbMATH OpenOpenAlexFDO

Authors Mariko Hagita, André Kündgen, Douglas B. West

Publication date 4 March 2004

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-003-0526-z

zbMATH Keywords

Cartesian productComplete graphHypercubeProbabilistic methodRandom graphUnion-free family

Mathematics Subject Classification ID

Distance in graphs (05C12) Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Extremal set theory (05D05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Recommendations

• scientific article; zbMATH DE number 2197887
• On Connected Resolving Decompositions in Graphs
• Upper bound of the decomposition dimension of a graph
• Decomposition of random graphs into complete bipartite graphs
• The decomposition dimension of graphs

Cited in

(8)

• Probabilistic methods in coloring and decomposition problems
• Probabilistic construction of proportional graphs
• scientific article; zbMATH DE number 1245629 (Why is no real title available?)
• Probabilistic equidimensional decomposition
• Decomposition dimension of corona product of some classes of graphs
• VERTEX DECOMPOSITION TO CALCULATE THE NETWORK PROBABILISTIC CONNECTIVITY
• Decomposition dimension of Cartesian product of some graphs
• Bounds for the decomposition dimension of some class of graphs

This page was built for publication: Probabilistic methods for decomposition dimension of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1423494)