Dual point-partition number of complementary graphs
Anton Kundrík (1990)
Mathematica Slovaca
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 “A new lower bound for the inducibility of a graph”
Dual point-partition number of complementary graphs
A small trivalent graph of girth 14.
Exoo, Geoffrey (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Combinatorial labelings of graphs.
Hegde, Suresh Manjanath, Shetty, Sudhakar (2006)
Applied Mathematics E-Notes [electronic only]
Similarity:
The remarkable generalized Petersen graph
Dragan Marušič, Tomaž Pisanski (2000)
Mathematica Slovaca
Similarity:
A note on randomly complete -partite graphs
Pavol Híc (1992)
Mathematica Slovaca
Similarity: