scientific article

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

Publication:3757929

zbMath0621.05013MaRDI QIDQ3757929

Jonathan L. Gross, Thomas W. Tucker

Publication date: 1987


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (only showing first 100 items - show all)

Polycyclic configurationsOn 2-factors splitting an embedded graph into two plane graphsCharacterizations of line graphs in signed and gain graphsParallel edges in ribbon graphs and interpolating behavior of partial-duality polynomialsCounterexamples to the interpolating conjecture on partial-dual genus polynomials of ribbon graphsNonorientable biembeddings of Steiner triple systemsMinor-minimal 6-regular graphs in the Klein bottle2-arc-transitive cyclic covers of \(K_{n,n}\)The 24 symmetry pairings of self-dual maps on the sphereBases of certain finite groupsThe genus of a random graphBounds for the average genus of the vertex-amalgamation of graphsAn algebraic analysis of the connectivity of De Bruijn and shuffle- exchange digraphsStratified graphs for imbedding systemsGraph covering projections arising from finite vector spaces over finite fieldsThe closed 2-cell embeddings of 2-connected doubly toroidal graphsThe symmetric genus of metacyclic groupsRegular graph coverings whose covering transformation groups have the isomorphism extension propertyMaximum genus and connectivityOn minimum-genus embeddingsA note on a Heegaard diagram of \(S^ 3\)Deterministic self-similar models of complex networks based on very symmetric graphsStraight-line representations of maps on the torus and other flat surfacesA tight lower bound on the maximum genus of a simplicial graphDistributions of regular branched prime-fold coverings of surfacesOn the parameterized complexity of monotone and antimonotone weighted circuit satisfiabilityA generalized Bartholdi zeta function for a regular covering of a bipartite graphUsing conics to construct geometric 3-configurations. II: The generalized Steiner constructionThe smallest surface that contains all signed graphs on \(K_{4, n}\)Classes of quantum codes derived from self-dual orientable embeddings of complete multipartite graphsHow to find \(G\)-admissible abelian regular coverings of a graph?Cyclic group blocking polyhedraEnumerating reflexible 2-cell embeddings of connected graphsCubic edge-transitive graphs of order 2\(p^{3}\)Weighted zeta functions for quotients of regular coverings of graphsNumber of spanning trees of different products of complete and complete bipartite graphsTypical circulant double coverings of a circulant graph.Distributions of regular branched surface coverings.Vanishing theorems and conjectures for the 2-homology of right-angled Coxeter groupsA simple construction for orientable triangular embeddings of the complete graphs on \(12 s\) verticesConstructing infinite one-regular graphsCharacteristic polynomials of graphs having a semifree actionGenus of the hypercube graph and real moment-angle complexesPartial duality for ribbon graphs. I: distributionsIsomorphisms of \(AC(\sigma)\) spaces for linear graphsThe weighted Kirchhoff index of a graphComputing stable epimorphisms onto finite groupsThe (\(n\), \(k\))-extendable graphs in surfacesConstructing goal-minimally \(k\)-diametric graphs by liftsOn oriented 2-factorable graphsCounterexamples to the nonorientable genus conjecture for complete tripartite graphsMaximum genus embeddings of Steiner triple systemsRegular embeddings of complete multipartite graphsDistinguishing index of mapsA characterization of projective-planar signed graphsBartholdi zeta functions of line graphs and middle graphs of graph coveringsBartholdi zeta functions of graph bundles having regular fibersLimits for embedding distributionsA zeta function with respect to non-backtracking alternating walks for a digraphA vertex weighted Bartholdi zeta function for a graphA note on directed genera of some tournamentsComplexity of the circulant foliation over a graphThe smallest self-dual embeddable graphs in a pseudosurfaceNon-crossing trees, quadrangular dissections, ternary trees, and duality-preserving bijectionsPartial duality for ribbon graphs. II: Partial-twuality polynomials and monodromy computationsHamiltonian and pseudo-Hamiltonian cycles and fillings in simplicial complexesOn \(\lambda\)-fold relative Heffter arrays and biembedding multigraphs on surfacesLocally restricted compositions over a finite groupThe monadic second-order logic of graphs. XII: Planar graphs and planar mapsThe genus of the product of a group with an Abelian groupSelf-dual Cayley mapsTopological models for classical configurationsA classification of regular embeddings of graphs of order a product of two primesAn infinite family of cubic edge- but not vertex-transitive graphsStraight-ahead walks in Eulerian graphsMaximum genus, girth and connectivityNonadditivity of the 1-genus of a graphToroidal maps of modular quotient groupsCycle factorizations of cycle productsLight spanners for high dimensional norms via stochastic decompositionsA survey on genus of selected graphs from commutative ringsLifting graph automorphisms by voltage assignmentsZeta functions of graph coveringsFace size and the maximum genus of a graph. I: Simple graphsOn the number of nonisomorphic orientable regular embeddings of complete graphsA note on the McKay-Miller-Širáň graphsFace covers and the genus problem for apex graphsEmbedding digraphs on orientable surfacesColoring face-hypergraphs of graphs on surfacesSewing ribbons on graphs in spaceExponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs.Optimal 1-edge fault-tolerant designs for ladders.Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems.Weighted zeta functions of digraphsBurnside chromatic polynomials of group-invariant graphsIrreducibility of the Tutte polynomial of an embedded graphA tight lower bound on the maximum genus of \(3\)-edge connected loopless graphsOn monoid graphsCoverings that preserve sense of directionThe semicircle law for semiregular bipartite graphs







This page was built for publication: