Drawing planar graphs with large vertices and thick edges.
Barequet, Gill, Goodrich, Michael T., Riley, Chris (2004)
Journal of Graph Algorithms and Applications
Similarity:
Displaying similar documents to “Small stretch spanners on dynamic graphs.”
Drawing planar graphs with large vertices and thick edges.
The excessive [3]-index of all graphs.
Cariolaro, David, Fu, Hung-Lin (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Total domination and matching numbers in claw-free graphs.
Henning, Michael A., Yeo, Anders (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On a problem of P. Vestergaard concerning circuits in graphs
Bohdan Zelinka (1987)
Czechoslovak Mathematical Journal
Similarity:
Reconstructing a Graph from the Incidence Relation on its Edge Set
Bohdan Zelinka (1972)
Matematický časopis
Similarity:
Partitions and edge colourings of multigraphs.
Kostochka, Alexandr V., Stiebitz, Michael (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Equitable colorations of graphs
D. de Werra (1971)
ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique
Similarity:
On edge detour graphs
A.P. Santhakumaran, S. Athisayanathan (2010)
Discussiones Mathematicae Graph Theory
Similarity:
For two vertices u and v in a graph G = (V,E), the detour distance D(u,v) is the length of a longest u-v path in G. A u-v path of length D(u,v) is called a u-v detour. A set S ⊆V is called an edge detour set if every edge in G lies on a detour joining a pair of vertices of S. The edge detour number dn₁(G) of G is the minimum order of its edge detour sets and any edge detour set of order dn₁(G) is an edge detour basis of G. A connected graph G is called an edge detour graph if it has...