Two extremal problems in graph theory.
Brualdi, Richard A., Mellendorf, Stephen (1994)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Building graphs from colored trees.”
Two extremal problems in graph theory.
Bridge and cycle degrees of vertices of graphs.
Chartrand, Gary, Saba, Farrokh, Wormald, Nicholas C. (1984)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Steiner distance in graphs
Gary Chartrand, Ortrud R. Oellermann, Song Lin Tian, Hung Bin Zou (1989)
Časopis pro pěstování matematiky
Similarity:
Finite graphs and their spanning trees
Jiří Sedláček (1967)
Časopis pro pěstování matematiky
Similarity:
A generalization of Hamiltonian cycles for trees
Ladislav Nebeský (1976)
Czechoslovak Mathematical Journal
Similarity: