Building graphs from colored trees.
Esselstein, Rachel M., Winkler, Peter (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Trees and matchings from point processes.”
Building graphs from colored trees.
Tree and grid factors for general point processes.
Timár, Ádám (2004)
Electronic Communications in Probability [electronic only]
Similarity:
Symmetric Laman theorems for the groups and .
Schulze, Bernd (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Trees and matchings.
Kenyon, Richard W., Propp, James G., Wilson, David B. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Two extremal problems in graph theory.
Brualdi, Richard A., Mellendorf, Stephen (1994)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Spanning trees of locally finite graphs
Bohdan Zelinka (1989)
Czechoslovak Mathematical Journal
Similarity:
Spanning trees of infinite graphs
Norbert Polat (1991)
Czechoslovak Mathematical Journal
Similarity:
On the Relationships between Zero Forcing Numbers and Certain Graph Coverings
Fatemeh Alinaghipour Taklimi, Shaun Fallat, Karen Meagher (2014)
Special Matrices
Similarity:
The zero forcing number and the positive zero forcing number of a graph are two graph parameters that arise from two types of graph colourings. The zero forcing number is an upper bound on the minimum number of induced paths in the graph that cover all the vertices of the graph, while the positive zero forcing number is an upper bound on the minimum number of induced trees in the graph needed to cover all the vertices in the graph. We show that for a block-cycle graph the zero forcing...