Domination, packing and excluded minors.
Böhme, Thomas, Mohar, Bojan (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Böhme, Thomas, Mohar, Bojan (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Ľubomír Šoltés (1991)
Mathematica Slovaca
Similarity:
Fujita, Shinya, Magnant, Colton (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Henning, Michael A., Yeo, Anders (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Vojtech Bálint, Ondrej Vacek (2004)
Mathematica Bohemica
Similarity:
The eccentricity of a vertex is defined as the distance to a farthest vertex from . The radius of a graph is defined as a . A graph is radius-edge-invariant if for every , radius-vertex-invariant if for every and radius-adding-invariant if for every . Such classes of graphs are studied in this paper.