The line-chromatic polynomial of a graph
Behzad, Mehdi, Chartrand, Gary (1968)
Portugaliae mathematica
Similarity:
Displaying similar documents to “On the genus of an n-connected graph”
The line-chromatic polynomial of a graph
Coelevation of a graph
Milan Mikola (1982)
Czechoslovak Mathematical Journal
Similarity:
A new characterization of the maximum genus of a graph
Ladislav Nebeský (1981)
Czechoslovak Mathematical Journal
Similarity:
A discontinuous function with a connected closed graph
Jiří Jelínek (2003)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
The point-outerthickness of complete -partite graphs
John Mitchem (1974)
Compositio Mathematica
Similarity:
On upper embeddability of complementary graphs
Ladislav Nebeský (1983)
Časopis pro pěstování matematiky
Similarity: