Regular graphs and their spanning trees
Jiří Sedláček (1970)
Časopis pro pěstování matematiky
Similarity:
Displaying similar documents to “Large bounded degree trees in expanding graphs.”
Regular graphs and their spanning trees
An algorithmic Friedman-Pippenger theorem on tree embeddings and applications.
Dellamonica, Domingos jun., Kohayakawa, Yoshiharu (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The number of labelled -arch graphs.
Lamathe, Cédric (2004)
Journal of Integer Sequences [electronic only]
Similarity:
Large trees in random graphs
Luděk Kučera, Vojtěch Rödl (1987)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Induced trees in triangle-free graphs.
Matousek, Jirí, Sámal, Robert (2008)
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:
Tree-Like Partial Hamming Graphs
Tanja Gologranc (2014)
Discussiones Mathematicae Graph Theory
Similarity:
Tree-like partial cubes were introduced in [B. Brešar, W. Imrich, S. Klavžar, Tree-like isometric subgraphs of hypercubes, Discuss. Math. Graph Theory, 23 (2003), 227-240] as a generalization of median graphs. We present some incorrectnesses from that article. In particular we point to a gap in the proof of the theorem about the dismantlability of the cube graph of a tree-like partial cube and give a new proof of that result, which holds also for a bigger class of graphs, so called tree-like...