A note on graph colouring
Dănuţ Marcu (1995)
Czechoslovak Mathematical Journal
Similarity:
Dănuţ Marcu (1995)
Czechoslovak Mathematical Journal
Similarity:
Ladislav Stacho (2002)
Mathematica Slovaca
Similarity:
Fujita, Shinya, Magnant, Colton (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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)
Wang, Ping, Xu, Baoguang, Wang, Jianfang (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Ladislav Nebeský (1979)
Czechoslovak Mathematical Journal
Similarity: