The excessive [3]-index of all graphs.
Cariolaro, David, Fu, Hung-Lin (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “The maximum of the maximum rectilinear crossing numbers of -regular graphs of order .”
The excessive [3]-index of all graphs.
On a problem of R. Häggkvist concerning edge-colourings of graphs
Bohdan Zelinka (1978)
Časopis pro pěstování matematiky
Similarity:
Drawing planar graphs with large vertices and thick edges.
Barequet, Gill, Goodrich, Michael T., Riley, Chris (2004)
Journal of Graph Algorithms and Applications
Similarity:
Parameters of bar -visibility graphs.
Felsner, Stefan, Massow, Mareike (2008)
Journal of Graph Algorithms and Applications
Similarity:
Acyclic chromatic index of a subdivided graph
Jozef Fiamčík (1984)
Archivum Mathematicum
Similarity:
Lower bounds for the number of bends in three-dimensional orthogonal graph drawings.
Wood, David R. (2003)
Journal of Graph Algorithms and Applications
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...