scientific article
From MaRDI portal
Publication:3847965
zbMath0109.41701MaRDI QIDQ3847965
Publication date: 1963
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (84)
Partial duality for ribbon graphs. III: A gray code algorithm for enumeration ⋮ Embedding grid graphs on surfaces ⋮ The projective-planar signed graphs ⋮ A graph-theoretical representation of PL-manifolds -- a survey on crystallizations ⋮ Topological Graph Theory: A Personal Account ⋮ The nonorientable genus of joins of complete graphs with large edgeless graphs ⋮ Upper bounds for domination related parameters in graphs on surfaces ⋮ Matching extension and the genus of a graph ⋮ On the genus of \({\mathbb{Z}}_ 3\times {\mathbb{Z}}_ 3\times {\mathbb{Z}}_ 3\) ⋮ Genus distributions for two classes of graphs ⋮ The imbedding index of a graph ⋮ Recent results in topological graph theory ⋮ The embedding of line graphs associated to the zero-divisor graphs of commutative rings ⋮ \(L(p,q)\)-labeling of a graph embeddable on the torus ⋮ Combinatorial map theory ⋮ On the 1-chromatic number of nonorientable surfaces with large genus ⋮ Rings whose cozero-divisor graph has crosscap number at most two ⋮ The genus of regular languages ⋮ On dynamic coloring for planar graphs and graphs of higher genus ⋮ The genus of curve, pants and flip graphs ⋮ The Genus of Repeated Cartesian Products of Bipartite Graphs ⋮ The matching extendability of surfaces ⋮ Classification of rings with projective zero-divisor graphs ⋮ The Genus of a Random Bipartite Graph ⋮ Surface embedding of \((n,k)\)-extendable graphs ⋮ On the matching extendability of graphs in surfaces ⋮ The non-orientable genus of some metacyclic groups ⋮ The (\(n\), \(k\))-extendable graphs in surfaces ⋮ On the Genus of a Group ⋮ The topological theory of current graphs ⋮ Counterexamples to the nonorientable genus conjecture for complete tripartite graphs ⋮ The Genera of Amalgamations of Graphs ⋮ Genus embeddings for some complete tripartite graphs ⋮ A new characterization of the maximum genus of a graph ⋮ On the restricted matching extension of graphs in surfaces ⋮ On the genus and thickness of graphs ⋮ On the genus of the graph \(K_n\times K_2\) or the n-prism ⋮ The genus of complete 3-uniform hypergraphs ⋮ Bounds for the genus of graphs with given Betti number ⋮ On the genus of the complete tripartite graph \(K_{n, n, 1}\) ⋮ Restricted matching in graphs of small genus ⋮ How to determine the maximum genus of a graph ⋮ Covering nearly surface-embedded graphs with a fixed number of balls ⋮ Sulla tracciabilita' di grafi finiti su superficie compatte ⋮ Observations on the construction of covers using permutation voltage assignments ⋮ New presentations of a link and virtual link ⋮ Spanning trees of dual graphs ⋮ Transportation networks: Old and new ⋮ The minimum genus of a two-point universal graph ⋮ Combinatorial statistics on alternating permutations ⋮ Invariants of Graphs Modeling Nucleotide Rearrangements ⋮ A Kuratowski theorem for nonorientable surfaces ⋮ On the maximum genus of a graph ⋮ A Kuratowski-type theorem for the maximum genus of a graph ⋮ Properties of the \(\phi\)-transformations of graphs and 2-manifolds ⋮ Hamiltonian circuits in some maps on the torus ⋮ Irreducible graphs ⋮ Counting rooted maps by genus. I ⋮ The genus of subgraphs of \(K_ 8\) ⋮ A lower bound for crossing numbers of graphs with application to \(K_n\),\(K_{pq}\)g, and \(Q(d)\) ⋮ A 4-color theorem of the Klein bottle ⋮ Irreducible graphs. II ⋮ A smooth and unified proof of cases 6, 5 and 3 of the Ringel-Youngs theorem ⋮ Special embeddings of the complete graph ⋮ Indecomposable permutations, hypermaps and labeled Dyck paths ⋮ A combinatorial analog of the Jordan Curve Theorem ⋮ Bounding the size of equimatchable graphs of fixed genus ⋮ Irreducible graphs ⋮ Embedding graphs in surfaces ⋮ Graphs of given genus and arbitrarily large maximum genus ⋮ The genus of 𝐾_{𝑛},𝑛=12(2^{𝑚}) ⋮ The genus of 𝐾_{𝑛},𝑛=12𝑠 ⋮ Unnamed Item ⋮ The Riemann-Hurwitz formula for the centralizer of a pair of permutations ⋮ Additivity of the genus of a graph ⋮ Local certification of graphs with bounded genus ⋮ Realizing the chromatic numbers of triangulations of surfaces ⋮ Surface Embedding of Non-Bipartite $k$-Extendable Graphs ⋮ On cubic graphs which are irreducible for nonorientable surfaces ⋮ Branched coverings of graph imbeddings ⋮ Extending matchings in graphs: A survey ⋮ On the Euler genus of a 2-connected graph ⋮ Embeddings of infinite graphs ⋮ Remarks on the Heawood conjecture (nonorientable case)
This page was built for publication:
