Acyclic chromatic index of a graph with maximum valency three
Jozef Fiamčík (1980)
Archivum Mathematicum
Similarity:
Displaying similar documents to “Acyclic chromatic index of a subdivided graph”
Acyclic chromatic index of a graph with maximum valency three
The excessive [3]-index of all graphs.
Cariolaro, David, Fu, Hung-Lin (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On a problem of R. Häggkvist concerning edge-colourings of graphs
Bohdan Zelinka (1978)
Časopis pro pěstování matematiky
Similarity:
Cyclicity of a complete 3-equipartite graph
Bohdan Zelinka (1985)
Archivum Mathematicum
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).