A new characterization of the maximum genus of a graph
Ladislav Nebeský (1981)
Czechoslovak Mathematical Journal
Similarity:
Displaying similar documents to “The maximum genus, matchings and the cycle space of a graph”
A new characterization of the maximum genus of a graph
On 2-cell embeddings of graphs with minimum numbers of regions
Ladislav Nebeský (1985)
Czechoslovak Mathematical Journal
Similarity:
A characterization of the decay number of a connected graph
Ladislav Nebeský (1995)
Mathematica Slovaca
Similarity:
Two extremal problems in graph theory.
Brualdi, Richard A., Mellendorf, Stephen (1994)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On upper embeddability of complementary graphs
Ladislav Nebeský (1983)
Časopis pro pěstování matematiky
Similarity: