Equivalence of a Number-Theoretical Problem with a Problem from the Graph Theory
Štefan Znám (1967)
Matematický časopis
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 “Euler formula and maps on surfaces”
Equivalence of a Number-Theoretical Problem with a Problem from the Graph Theory
The order of monochromatic subgraphs with a given minimum degree.
Caro, Yair, Yuster, Raphael (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).
Eulerian polar graphs
Bohdan Zelinka (1976)
Czechoslovak Mathematical Journal
Similarity:
Complete and pseudocomplete colourings of a graph
Juraj Bosák, Jaroslav Nešetřil (1976)
Mathematica Slovaca
Similarity: