Eulerian polar graphs
Bohdan Zelinka (1976)
Czechoslovak Mathematical Journal
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “On the minimal length of the longest trail in a fixed edge-density graph”
Eulerian polar graphs
A note on the edge-connectivity of cages.
Wang, Ping, Xu, Baoguang, Wang, Jianfang (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The Turàn number of the graph 3P4
Halina Bielak, Sebastian Kieliszek (2014)
Annales UMCS, Mathematica
Similarity:
Let ex (n,G) denote the maximum number of edges in a graph on n vertices which does not contain G as a subgraph. Let Pi denote a path consisting of i vertices and let mPi denote m disjoint copies of Pi. In this paper we count ex(n, 3P4)
-saturated graphs of minimum size
Zsolt Tuza (1989)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
On Hadwiger number of a graph
Bohdan Zelinka (1975)
Časopis pro pěstování matematiky
Similarity:
Regular Graphs, Each Edge of Which Belongs to Exactly One -Gon
Anton Kotzig, Bohdan Zelinka (1970)
Matematický časopis
Similarity: