Der vollständige paare Graph auf nichtorientierbaren Flächen.

From MaRDI portal
Publication:5341593

DOI10.1515/crll.1965.220.88zbMath0132.21204OpenAlexW4251745102MaRDI QIDQ5341593

Gerhard Ringel

Publication date: 1965

Published in: Journal für die reine und angewandte Mathematik (Crelles Journal) (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/150703




Related Items (40)

Unnamed ItemNonorientable genus of nearly complete bipartite graphsConstructing all minimum genus embeddings ofThe nonorientable genus of joins of complete graphs with large edgeless graphsEquimatchable Graphs on SurfacesThe \(\mathbb{Z}_2\)-genus of Kuratowski minorsMinimal quadrangulations of surfacesSpectral radius of finite and infinite planar graphs and of graphs of bounded genusHamiltonian Cycles in 4-Connected Planar and Projective Planar Triangulations with Few 4-SeparatorsOn 2-connected spanning subgraphs with low maximum degreeThe nonorientable genus of the join of two cyclesSettling the nonorientable genus of the nearly complete bipartite graphsOrientable embeddings and orientable cycle double covers of projective-planar graphsNonorientable Hamilton cycle embeddings of complete tripartite graphsHamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a surveyGroups of graphs on given surfacesQuadrangular embeddings of the complete even k-partite graphThe largest demigenus over all signatures on \(K_{3,n}\)Unnamed ItemThe (\(n\), \(k\))-extendable graphs in surfacesCounterexamples to the nonorientable genus conjecture for complete tripartite graphsOrientable and non orientable genus of the complete bipartite graphRank-width and tree-width of \(H\)-minor-free graphsGenus embeddings for some complete tripartite graphsExponentially many nonisomorphic genus embeddings of \(K_{n,m}\)The nonorientable genus of complete tripartite graphsUnnamed ItemSome results in topological graph theoryThe genus of the balanced hypercubeRestricted matching in graphs of small genusThe orientable genus of some joins of complete graphs with large edgeless graphsRings whose zero-divisor graphs have positive genusBounding the number of non-duplicates of the \(q\)-side in simple drawings of \(K_{p,q}\)The toroidal crossing number of \(K_{4,n}\)Constructing a minimum genus embedding of the complete tripartite graph \(K_{n, n, 1}\) for odd \(n\)Bounding the size of equimatchable graphs of fixed genusThe splitting number of complete bipartite graphsQuadrangular embeddings of complete graphs and the even map color theoremFlexibility of polyhedral embeddings of graphs in surfacesUnnamed Item




This page was built for publication: Der vollständige paare Graph auf nichtorientierbaren Flächen.