Relaxed graceful labellings of trees.
Van Bussel, Frank (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Tree-thickness and caterpillar-thickness under girth constraints.”
Relaxed graceful labellings of trees.
Maxmaxflow and counting subgraphs.
Jackson, Bill, Sokal, Alan D. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The structure of locally finite two-connected graphs.
Droms, Carl, Servatius, Brigitte, Servatius, Herman (1995)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On external-memory planar depth first search.
Arge, Lars, Meyer, Ulrich, Toma, Laura, Zeh, Norbert (2003)
Journal of Graph Algorithms and Applications
Similarity:
Contraction distance between isomorphism classes of graphs
Bohdan Zelinka (1990)
Časopis pro pěstování matematiky
Similarity:
Edge shift distance between trees
Bohdan Zelinka (1992)
Archivum Mathematicum
Similarity:
Edge shift distance between isomorphism classes of graphs, introduced by M. Johnson, is investigated in the case of trees and compared with other distances.
On the Vertex Separation of Cactus Graphs
Markov, Minko (2007)
Serdica Journal of Computing
Similarity:
This paper is part of a work in progress whose goal is to construct a fast, practical algorithm for the vertex separation (VS) of cactus graphs. We prove a theorem for cacti", a necessary and sufficient condition for the VS of a cactus graph being k. Further, we investigate the ensuing ramifications that prevent the construction of an algorithm based on that theorem only.
On vertices and edges in maximum path-factors of a tree
Zdzisław Skupień, Władysław Zygmunt (1980)
Fundamenta Mathematicae
Similarity: