Das Geschlecht des vollständigen paaren Graphen

From MaRDI portal
Revision as of 19:15, 2 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2395458

DOI10.1007/BF02993245zbMath0132.21203OpenAlexW1998391578WikidataQ29396478 ScholiaQ29396478MaRDI QIDQ2395458

No author found.

Publication date: 1965

Published in: Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02993245




Related Items (86)

The choice number versus the chromatic number for graphs embeddable on orientable surfacesEmbedding grid graphs on surfacesTree densities in sparse graph classesUnnamed ItemUnnamed ItemTopological Graph Theory: A Personal AccountConstructing all minimum genus embeddings ofOn the number of genus embeddings of complete bipartite graphsMaximum and minimum toughness of graphs of small genusEquimatchable Graphs on SurfacesThe largest parity demigenus of a simple graphOrientable Hamilton Cycle Embeddings of Complete Tripartite Graphs II: Voltage Graph Constructions and ApplicationsThe \(\mathbb{Z}_2\)-genus of Kuratowski minorsMinimal quadrangulations of surfacesOn the genus of joins and compositions of graphsLocal optimization on graphsSpectral 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 connectivity of the dualThe smallest surface that contains all signed graphs on \(K_{4, n}\)On Density of \(\boldsymbol{\mathbb{Z}_3}\) -Flow-Critical GraphsSimultaneous coloring of vertices and incidences of outerplanar graphsSettling the nonorientable genus of the nearly complete bipartite graphsIsomorphism Testing Parameterized by Genus and BeyondOrientable embeddings and orientable cycle double covers of projective-planar graphsThe genus of curve, pants and flip graphsHamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a surveyGroups of graphs on given surfacesThe Genus of Repeated Cartesian Products of Bipartite GraphsQuadrangular embeddings of the complete even k-partite graphThe Genus of a Random Bipartite GraphBi-embeddings of graphsClean triangulationsGenus embeddings of a type of graphUniformization of hyperelliptic curves as a systematic approach to establishing decision regions of hyperbolic signal setsThe medial graph and voltage-current dualityThe (\(n\), \(k\))-extendable graphs in surfacesThe genus of a type of graphON THE GENUS OF THE INTERSECTION GRAPH OF IDEALS OF A COMMUTATIVE RINGThe Genera of Edge Amalgamations of Complete BigraphsComponents of branched coverings of current graphsTwofold triple systems and graph imbeddingsCounterexamples to the nonorientable genus conjecture for complete tripartite graphsOrientable and non orientable genus of the complete bipartite graphOrientable imbedding of line-graphsRank-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 ItemConnectivity, genus, and the number of components in vertex-deleted subgraphsThe $\mathbb{Z}_2$-genus of Kuratowski minorsOn the genus and thickness of graphsLyapunov graphs for circle valued functionsSome results in topological graph theoryGraph theoryThe genus of the balanced hypercubeOn the genus of the complete tripartite graph \(K_{n, n, 1}\)Restricted matching in graphs of small genusClassification of Rings with Genus One Zero-Divisor GraphsSubexponential-time algorithms for finding large induced sparse subgraphsStronger ILPs for the Graph Genus Problem.Sulla tracciabilita' di grafi finiti su superficie compatteThe orientable genus of some joins of complete graphs with large edgeless graphsNew methods for finding minimum genus embeddings of graphs on orientable and non-orientable surfacesThe orientable genus of the join of a cycle and a complete graphBounding the number of non-duplicates of the \(q\)-side in simple drawings of \(K_{p,q}\)The genus of the Cartesian product of two graphsOn the relationship between the genus and the cardinality of the maximum matchings of a graphDetermining all compact orientable 2-manifolds upon which \(K_{m,n}\) has 2-cell imbeddingsDetermining all compact orientable 2-manifolds upon which \(K_{m,n}\) has 2-cell imbeddingsThe toroidal crossing number of \(K_{4,n}\)Hamiltonian circuits in some maps on the torusOn the genus and connectivity of Hamiltonian graphsA lower bound for crossing numbers of graphs with application to \(K_n\),\(K_{pq}\)g, and \(Q(d)\)Bounding the size of equimatchable graphs of fixed genusBounds for scattering number and rupture degree of graphs with genusThe splitting number of complete bipartite graphsQuadrangular embeddings of complete graphs and the even map color theorem5-chromatic even triangulations on the Klein bottleRandom Cayley maps for groups generated by involutionsA New View of Hypercube GenusOn embeddings of circulant graphsUnnamed ItemConvertible andm-convertible matrices




Cites Work




This page was built for publication: Das Geschlecht des vollständigen paaren Graphen