Even circuits of prescribed clockwise parity.
Fischer, Ilse, Little, C.H.C. (2003)
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 “Local expansions on graphs”
Even circuits of prescribed clockwise parity.
An ordering of some metrics defined on the space of graphs
Mark Johnson (1987)
Czechoslovak Mathematical Journal
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...
On the minimal length of the longest trail in a fixed edge-density graph
Vajk Szécsi (2013)
Open Mathematics
Similarity:
A nearly sharp lower bound on the length of the longest trail in a graph on n vertices and average degree k is given provided the graph is dense enough (k ≥ 12.5).
Intersection Graphs of Graphs
Bohdan Zelinka (1975)
Matematický časopis
Similarity: