Regular Graphs, Each Edge of Which Belongs to Exactly One -Gon
Anton Kotzig, Bohdan Zelinka (1970)
Matematický časopis
Similarity:
Displaying similar documents to “On signed degrees in signed graphs”
Regular Graphs, Each Edge of Which Belongs to Exactly One -Gon
On Hadwiger number of a graph
Bohdan Zelinka (1975)
Časopis pro pěstování matematiky
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).