Constructive upper bounds for cycle-saturated graphs of minimum size.
Gould, Ronald, Łuczak, Tomasz, Schmitt, John (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “A note on the number of edges guaranteeing a in Eulerian bipartite digraphs.”
Constructive upper bounds for cycle-saturated graphs of minimum size.
Decomposition of a Digraph into Isomorphic Subgraphs
Bohdan Zelinka (1970)
Matematický časopis
Similarity:
Centers of directed cacti
Bohdan Zelinka (1989)
Časopis pro pěstování matematiky
Similarity:
On -Pancyclic Graphs
Vasil Jacoš (1975)
Matematický časopis
Similarity:
Every connected acyclic digraph of height 1 is neighbourhood-realizable
Bohdan Zelinka (1991)
Archivum Mathematicum
Similarity: