Additivity of the genus of a graph
From MaRDI portal
Publication:5518140
DOI10.1090/S0002-9904-1962-10847-7zbMath0142.41501MaRDI QIDQ5518140
Frank Harary, Yukihiro Kodama, J. W. T. Youngs, J. Battle
Publication date: 1962
Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)
Related Items
Irreducible graphs, Recent results in topological graph theory, Classification of Rings with Genus One Zero-Divisor Graphs, The Genera of Edge Amalgamations of Complete Bigraphs, The Genera of Amalgamations of Graphs, Tilings of the Torus and the Klein Bottle and Vertex-Transitive Graphs on a Fixed Surface, On the relationship between the genus and the cardinality of the maximum matchings of a graph, Embeddings of graphs with no short noncontractible cycles, Embedding graphs in surfaces, On cubic graphs which are irreducible for nonorientable surfaces, On the Euler genus of a 2-connected graph, On the non-orientable genus of a 2-connected graph, An additivity theorem for the genus of a graph, The crossing function of a graph, The nonadditivity of the genus, Orientable imbedding of line-graphs, 103 graphs that are irreducible for the projective plane, On the genus of the graph \(K_n\times K_2\) or the n-prism, Upper-embeddable graphs and related topics, An obstruction to embedding graphs in surfaces, A simpler proof of the excluded minor theorem for higher surfaces, Color-critical graphs on a fixed surface, On the genus of joins and compositions of graphs, Nonadditivity of the 1-genus of a graph, A Kuratowski theorem for nonorientable surfaces, Graphs of given genus and arbitrarily large maximum genus, Bounds for the average genus of the vertex-amalgamation of graphs, Extension of a theorem of Whitney, The genus of the Cartesian product of two graphs, On the maximum genus of a graph, A Kuratowski-type theorem for the maximum genus of a graph, Irreducible graphs, On the genera of graphs of group presentations. III, Irreducible graphs. II, A map colour theorem for the union of graphs, Unnamed Item, Sulla tracciabilita' di grafi finiti su superficie compatte, Bi-embeddings of graphs
Cites Work
