On graphs containing many subgraphs with the same number of edges
Jozef Širáň (1980)
Mathematica Slovaca
Similarity:
Displaying similar documents to “Edge cover time for regular graphs.”
On graphs containing many subgraphs with the same number of edges
A note on the edge-connectivity of cages.
Wang, Ping, Xu, Baoguang, Wang, Jianfang (2003)
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).
Decompositions of graphs into 5-cycles and other small graphs.
Sousa, Teresa (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Complete and pseudocomplete colourings of a graph
Juraj Bosák, Jaroslav Nešetřil (1976)
Mathematica Slovaca
Similarity:
Regular Graphs, Each Edge of Which Belongs to Exactly One -Gon
Anton Kotzig, Bohdan Zelinka (1970)
Matematický časopis
Similarity: