Acyclic chromatic index of a subdivided graph
Jozef Fiamčík (1984)
Archivum Mathematicum
Similarity:
Displaying similar documents to “Acyclic chromatic index of a graph with maximum valency three”
Acyclic chromatic index of a subdivided graph
On a problem of R. Häggkvist concerning edge-colourings of graphs
Bohdan Zelinka (1978)
Časopis pro pěstování matematiky
Similarity:
On some Ramsey and Turán-type numbers for paths and cycles.
Dzido, Tomasz, Kubale, Marek, Piwakowski, Konrad (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The excessive [3]-index of all graphs.
Cariolaro, David, Fu, Hung-Lin (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The Turàn number of the graph 3P4
Halina Bielak, Sebastian Kieliszek (2014)
Annales UMCS, Mathematica
Similarity:
Let ex (n,G) denote the maximum number of edges in a graph on n vertices which does not contain G as a subgraph. Let Pi denote a path consisting of i vertices and let mPi denote m disjoint copies of Pi. In this paper we count ex(n, 3P4)