On partially directed -graphs
Pavol Híc (1984)
Mathematica Slovaca
Similarity:
Displaying similar documents to “-path Euler graphs”
On partially directed -graphs
Polar graphs and railway traffic
Bohdan Zelinka (1974)
Aplikace matematiky
Similarity:
Hamiltonicity of -traceable graphs.
Bullock, Frank, Dankelmann, Peter, Frick, Marietjie, Henning, Michael A., Oellermann, Ortrud R., van Aardt, Susan (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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).
Independence number and disjoint theta graphs.
Fujita, Shinya, Magnant, Colton (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity: