scientific article; zbMATH DE number 3236772
From MaRDI portal
zbMath0146.45603MaRDI QIDQ5524326
Publication date: 1966
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Infinite paths that contain only shortest paths, Tetravalent half-arc-transitive graphs of order a product of three primes, The tree of cuts and minimal \(k\)-connected graphs, Minimal \(k\)-connected graphs with minimal number of vertices of degree \(k\), Deleting vertices from a 2-connected graph with preserving 2-connectedness, A short proof and a strengthening of the Whitney 2-isomorphism theorem on graphs, Polynomial properties on large symmetric association schemes, Bicircular matroids representable over \(\mathrm{GF}(4)\) or \(\mathrm{GF}(5)\), Finding a homotopy base for directed paths in an acyclic graph, The structure of graphs not topologically containing the Wagner graph, Medial layer graphs of equivelar 4-polytopes, Symmetrical path-cycle covers of a graph and polygonal graphs, A zero-free interval for flow polynomials of cubic graphs, The reconstruction for separable graphs with 2-connected trunks that are series-parallel networks, Bounding and stabilizing realizations of biased graphs with a fixed group, Tetravalent edge-transitive graphs of girth at most 4, Tetravalent half-transitive graphs of order \(4p\), NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems, Exact values of \(ex(\nu ; \{C_{3},C_{4},\dots ,C_n\})\), Minimal separating sets of maximum size, Automorphism group of the complete transposition graph, A smallest graph of girth 5 and valency 6, Über Tuttes Cages, An efficient PQ-graph algorithm for solving the graph-realization problem, Planarity and duality of finite and infinite graphs, A plane graph representation of triconnected graphs, Decomposition of regular matroids, Linear programming bounds for regular graphs, A smallest graph of girth 10 and valency 3, Counting labelled three-connected and homeomorphically irreducible two- connected graphs, Counting unlabelled three-connected and homeomorphically irreducible two- connected graphs, The edge-transitive tetravalent Cayley graphs of square-free order, Generalized flowers in \(k\)-connected graphs. II, The decomposition tree of a biconnected graph, Minimal biconnected graphs, Finite edge-transitive oriented graphs of valency four: a global approach, The cactus tree of a metric space, Graphs having circuits with at least two chords, The nonexistence of 8-transitive graphs, Augmenting the edge connectivity of planar straight line graphs to three, On planarity of compact, locally connected, metric spaces, On the maximum number of independent edges in cubic graphs, Practical and efficient split decomposition via graph-labelled trees, Cycles through three vertices in 2-connected graphs, Edge bipartization faster than \(2^k\), A linear-time algorithm for finding an ambitus, Displaying blocking pairs in signed graphs, Counting the number of perfect matchings in \(K_{5}\)-free graphs, A classification of tightly attached half-arc-transitive graphs of valency 4, Smallest tetravalent half-arc-transitive graphs with the vertex-stabiliser isomorphic to the dihedral group of order 8, A new graph triconnectivity algorithm and its parallelization, An extension of the multi-path algorithm for finding Hamilton cycles, The separated box product of two digraphs, Detecting cycles through three fixed vertices in a graph, On the crossing numbers of certain generalized Petersen graphs, The decomposition of graphs into \(k\)-connected components, Some conditions for 1-transitivity, Connectivity of submodular functions, Limit points for average genus. II: 2-connected non-simplicial graphs, Tetravalent half-arc-transitive graphs of order \(2pq\), A minimum 3-connectivity augmentation of a graph, Semisymmetric cubic graphs of order \(16p^{2}\), Lower bound of cyclic edge connectivity for \(n\)-extendability of regular graphs, The enumeration of homeomorphically irreducible labelled graphs, On Eulerian circuits and words with prescribed adjacency patterns, Über s-reguläre Graphen, Über symmetrische Graphen vom Grad fünf, A classification of 4-connected graphs, Counting rooted maps by genus. III: Nonseparable maps, Rigidity, global rigidity, and graph decomposition, There exists no tetravalent half-arc-transitive graph of order \(2p^{2}\), Almost all quartic half-arc-transitive weak metacirculants of class II are of class IV, Eckenprimitive Graphen vom Grad drei, Separation of vertices by a circuit, A composition for matroids, Chromatic number and girth, Statistical theory of connectivity. I: Basic definitions and properties, Über lokal s-reguläre Graphen, Graphs from projective planes, Glatt einbettbare Untergraphen, Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen, Über symmetrische Graphen und die projektiven Gruppen, Vector representations of graphs, Generating 3-vertex connected spanning subgraphs, Turing kernelization for finding long paths and cycles in restricted graph classes, Non-planar core reduction of graphs, On quartic half-arc-transitive metacirculants, Homogeneous factorisations of complete graphs with edge-transitive factors, Hexavalent half-arc-transitive graphs of order \(4p\), On the classification of quartic half-arc-transitive metacirculants, Path traversability in planar graphs, Kantenprimitive Graphen vom Grad drei, Canonical decompositions of symmetric submodular systems, Interconnection networks for parallel molecular dynamics simulation based on Hamiltonian cubic symmetric topology, Embedding graphs in surfaces, Decomposition of submodular functions, Edge-contraction problems, Distance-transitive graphs and generalized polygons, Counting labelled chordal graphs, Spanning trees in random series-parallel graphs, The classification of half-arc-regular bi-circulants of valency 6, On primitive permutation groups with small suborbits and their orbital graphs., Regular bipartite graphs with all 2-factors isomorphic, Decomposition of 3-connected graphs, Graphs and digraphs with given girth and connectivity, On the equivalence of constrained and unconstrained flows, Planarity testing in parallel, Binary constraint satisfaction problems defined by excluded topological minors, The arborescence-realization problem, On factor-invariant graphs with two cycles, The construction and reduction of strong snarks, Planar graphs on the projective plane, Self-dual graphs, On the decomposition of a 3-connected graph into cyclically 4-edge-connected components, Correspondences without a core, 3-connected reduction for regular graph covers, The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs, Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees, On the radius and the attachment number of tetravalent half-arc-transitive graphs, Sliding piece puzzles with oriented tiles, Recent developments in half-transitive graphs, Projective plan and Möbius band obstructions, Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested, Symmetric graphs from polytopes of high rank, Generalized flowers in \(k\)-connected graphs, The structure of a decomposition of a triconnected graph, The circumference of a graph with no \(K_{3,t}\)-minor. II, Arbitrarily traceable graphs and digraphs, Radically solvable graphs, A family of edge-transitive Cayley graphs, 2-factor Hamiltonian graphs., A tetravalent half-arc-transitive graph with non-abelian vertex stabilizer, Generating \(r\)-regular graphs, Edge-transitive bi-Cayley graphs, On contractible 5-vertex subgraphs of a 3-connected graph, On the structure of a 3-connected graph. II, On critical 3-connected graphs with two vertices of degree 3. II, Constructive characterizations for packing and covering with trees, An SPQR-tree-like embedding representation for upward planarity, Large contractible subgraphs of a 3-connected graph, New structural results on tetravalent half-arc-transitive graphs, The flip Markov chain for connected regular graphs, Half-arc-transitive graphs and chiral hypermaps., A strengthening of Erdős-Gallai theorem and proof of Woodall's conjecture, Tetravalent half-arc-transitive graphs with unbounded nonabelian vertex stabilizers, Generalized Gardiner-Praeger graphs and their symmetries, Connectivity keeping trees in \(2\)-connected graphs with girth conditions, Using SPQR-trees to speed up recognition algorithms based on 2-cutsets, No hexavalent half-arc-transitive graphs of order twice a prime square exist, Hexavalent half-arc-transitive graphs of order \(9 p\), The contributions of W.T. Tutte to matroid theory, Upper bound on distance in the pants complex, Codichromatic graphs, A tighter insertion-based approximation of the crossing number, Partial matroid representations, Planar minimally rigid graphs and pseudo-triangulations, Connected rigidity matroids and unique realizations of graphs, Turing kernelization for finding long paths in graph classes excluding a topological minor, On the 2-sum in rigidity matroids, On proper edge 3-colorings of a cubic graph, Bridges and Hamiltonian circuits in planar graphs, Congestion games viewed from M-convexity, On automorphism groups of deleted wreath products, Regular groups of automorphisms of cubic graphs, Maximal independent sets and maximal matchings in series-parallel and related graph classes, Candidate keys for relations, On semisymmetric cubic graphs of order \(20p^2\), \(p\) prime, Maximal Hamiltonian cycles in squares of graphs, Minor obstructions for apex-pseudoforests, Graph isomorphism, general remarks, Half-arc-transitive graphs and the Fano plane, Net structure and cages, Soldering and point splitting, Tetravalent half-arc-transitive graphs of order \(8p\), Faster approximation algorithms for weighted triconnectivity augmentation problems, Some degree and distance-based invariants of wreath products of graphs, Half-transitive group actions on finite graphs of valency 4, On testing consecutive-ones property in parallel, The family of bicircular matroids closed under duality, A characterization of infinite planar primitive graphs, On the complexity of the approximation of nonplanarity parameters for cubic graphs, Subdivisional spaces and graph braid groups, The graphs that have antivoltages using groups of small order, On enumerating the trees of the wheel and other special graphs, Maximum genus, girth and connectivity, Half-transitivity of some metacirculants, Tetravalent half-arc-transitive graphs of order \(p^5\), Graph puzzles, homotopy, and the alternating group, A characterization of graphs with no cube minor, On half-transitive metacirculant graphs of prime-power order, On essential and inessential polygons in embedded graphs, On a conjecture of Lovász concerning bricks. I: The characteristic of a matching covered graph, Sewing ribbons on graphs in space, Tetravalent graphs admitting half-transitive group actions: Alternating cycles, Bounds for the global cyclicity index of a general network via weighted majorization, Weakly flag-transitive configurations and half-arc-transitive graphs, Note on infinite families of trivalent semisymmetric graphs, Graphs which are locally Grassmann, Circular embedding of planar graphs in nonspherical surfaces, On infinite, cubic, vertex-transitive graphs with applications to totally disconnected, locally compact groups, Classification of the pentavalent symmetric graphs of order $8pq$, Packing cycles in undirected group-labelled graphs, On the bond polytope, Inserting Multiple Edges into a Planar Graph, Uniformly connected graphs, Listing the bonds of a graph in \(\widetilde{O} (n)\)-delay, On semi-reconstruction of graphs of connectivity 2, Computing Circuit Polynomials in the Algebraic Rigidity Matroid, Unnamed Item, Unnamed Item, Unnamed Item, On matroid connectivity, Graph theory, Atoms of cyclic edge connectivity in regular graphs, Half-arc-transitive graphs of arbitrary even valency greater than 2, Graph isomorphism restricted by lists, Automorphisms of subgraphs obtained by deleting a pendant vertex, Automorphisms of subgraphs obtained by deleting a pendant vertex, Kernelization of Whitney Switches, Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions, Finite graphs of valency 4 and girth 4 admitting half-transitive group actions, Finite and infinite vertex-transitive cubic graphs and their distinguishing cost and density, Decomposition of a 2-connected graph into three connected subgraphs, On critical 3-connected graphs with two vertices of degree 3. I, Characterizing 2-crossing-critical graphs, Some Basic Definitions in Graph Theory, Unnamed Item, Primitive half-transitive graphs constructed from the symmetric groups of prime degrees, Symmetric Graphs with Projective Subconstituents, The maximum degree of random planar graphs, Unnamed Item, A family of tetravalent half-arc-transitive graphs, Jordan-like characterization of automorphism groups of planar graphs, Graph classes with given 3-connected components: asymptotic counting and critical phenomena, Finite 3-connected-set-homogeneous locally \(2\mathbf{K}_n\) graphs and \(s\)-arc-transitive graphs, Tetravalent half-arc-transitive graphs of order \(p^4\), Unnamed Item, A general class of invulnerable graphs, Construction sequences and certifying 3-connectivity, On strict brambles, Polyhedral decompositions of cubic graphs, Asymptotic enumeration and limit laws for graphs of fixed genus, On the Diameter of Random Planar Graphs, Half-arc-transitive graphs of prime-cube order of small valencies, Local convergence of random planar graphs, Group-theoretic generalisations of vertex and edge connectivities, Recipes for edge-transitive tetravalent graphs, Splitting groups with cubic Cayley graphs of connectivity two, The planar Cayley graphs are effectively enumerable. II, Half-arc-transitive group actions with a small number of alternets, Hadwiger's Conjecture for ℓ‐Link Graphs, The arc-types of Cayley graphs, On the Number of Unknot Diagrams, Cycle bases for the flexibility analysis of structures, On a new cyclicity measure of graphs -- the global cyclicity index, Graphs with no 7-wheel subdivision, ON THE CUBIC EDGE-TRANSITIVE GRAPHS OF ORDER $58p2$, On (I*.n)-regular graphs, Unnamed Item, Constructing even radius tightly attached half-arc-transitive graphs of valency four, Unnamed Item, Half-transitive graphs of valency 4 with prescribed attachment numbers, A CACTUS THEOREM FOR END CUTS, Maximal independent sets and maximal matchings in series-parallel and related graph classes, The tree-covering number of a graph, Automorphisms of Cayley graphs of metacyclic groups of prime-power order, On the mathematical formulation of the wiring problem, Uniform random sampling of planar graphs in linear time, Searching symmetric networks with Utilitarian-Postman paths, Weak embedding of planar graphs, Some Topics in Graph Theory, A new deterministic network reliability measure, An infinite family of tetravalent half-arc-transitive graphs, Classification of half-arc-transitive graphs of order \(4p\), The Basis Number of Some Special Non-Planar Graphs, Maintenance of triconnected components of graphs, On the Minus Domination Number of Graphs, Tetravalent half-arc-transitive \(p\)-graphs, Asymptotic enumeration and limit laws of planar graphs, Bipartite edge-transitive bi-p-metacirculants, Zur Theorie der n-fach zusammenhängenden Graphen, Untersuchungen über minimale \(n\)-fach zusammenhängende Graphen, Maximizing the Order of a Regular Graph of Given Valency and Second Eigenvalue, Convexity in directed graphs, Über den Zusammenhang symmetrischer Graphen, Tetravalent half-arc-transitive graphs of order $p^2q^2$, Ecken n-ten Grades in minimalen n-fach zusammenhängenden Graphen, Unendliche minimale \(n\)-fach zusammenhängende Graphen, Analyse und Synthese zuverlässiger Netze, Recursive families of graphs, Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte, Connectivity, line-connectivity and J-conntection of the total graph, On the action of non-Abelian groups on graphs, On edge but not vertex transitive regular graphs, Mondshein Sequences (a.k.a. (2,1)-Orders), Fixing subgraphs, Meshes on 3-connected graphs, A trivalent graph of girth ten, Fixing subgraphs of s-regular graphs, On regular graphs. III, Tilings of the Torus and the Klein Bottle and Vertex-Transitive Graphs on a Fixed Surface, Large tactical configurations, Graphs with valency k, edge connectivity k, chromatic index k+1 and arbitrary girth, Über symmetrische Graphen , deren Valenz eine Primzahl ist, Colour-critical graphs and hypergraphs, Ultrametric properties for valuation spaces of normal surface singularities, Segment graphs, depth-first cycle bases, 3-connectivity, and planarity of graphs, Finding triconnected components of graphs, Kernelization of Whitney Switches, A robust algorithm for bisecting a triconnected graph with two resource sets, Quartic half-arc-transitive graphs with large vertex stabilizers, Maximum cycle packing using SPR-trees, Blocks in \(k\)-connected graphs, Buildings and s-Transitive Graphs, Graph decompositions definable in monadic second-order logic, Nonseparating Cocircuits in Binary Matroids, Vertex-primitive ½-arc-transitive graphs of smallest order, Unnamed Item, The minimum number of edges and vertices in a graph with edge connectivity 𝑛 and 𝑚 𝑛-bonds
