scientific article; zbMATH DE number 3236772

Cited in

(only showing first 100 items - show all)

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
Interconnection networks for parallel molecular dynamics simulation based on Hamiltonian cubic symmetric topology
Embedding graphs in surfaces
Decomposition of submodular functions
Distance-transitive graphs and generalized polygons
Counting labelled chordal graphs
Infinite paths that contain only shortest paths
A short proof and a strengthening of the Whitney 2-isomorphism theorem on graphs
Finding a homotopy base for directed paths in an acyclic graph
The reconstruction for separable graphs with 2-connected trunks that are series-parallel networks
NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems
Minimal separating sets of maximum size
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
Decomposition of regular matroids
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
Graphs having circuits with at least two chords
The nonexistence of 8-transitive graphs
On the maximum number of independent edges in cubic graphs
Cycles through three vertices in 2-connected graphs
A linear-time algorithm for finding an ambitus
A new graph triconnectivity algorithm and its parallelization
An extension of the multi-path algorithm for finding Hamilton cycles
Detecting cycles through three fixed vertices in a graph
On the crossing numbers of certain generalized Petersen graphs
Connectivity of submodular functions
Limit points for average genus. II: 2-connected non-simplicial graphs
A minimum 3-connectivity augmentation of a graph
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
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
Bridges and Hamiltonian circuits in planar graphs
Regular groups of automorphisms of cubic graphs
Candidate keys for relations
Maximal Hamiltonian cycles in squares of graphs
Graph isomorphism, general remarks
Net structure and cages
Soldering and point splitting
Faster approximation algorithms for weighted triconnectivity augmentation problems
Half-transitive group actions on finite graphs of valency 4
On testing consecutive-ones property in parallel
Tetravalent graphs admitting half-transitive group actions: Alternating cycles
Weakly flag-transitive configurations and half-arc-transitive graphs
Graphs which are locally Grassmann
Circular embedding of planar graphs in nonspherical surfaces
Graphs and digraphs with given girth and connectivity
On the equivalence of constrained and unconstrained flows
Planarity testing in parallel
The construction and reduction of strong snarks
Sliding piece puzzles with oriented tiles
Recent developments in half-transitive graphs
Projective plan and Möbius band obstructions
Arbitrarily traceable graphs and digraphs
2-factor Hamiltonian graphs.
A tetravalent half-arc-transitive graph with non-abelian vertex stabilizer
Generating \(r\)-regular graphs
Constructive characterizations for packing and covering with trees
Half-arc-transitive graphs and chiral hypermaps.
Maximum genus, girth and connectivity
Half-transitivity of some metacirculants
Binary constraint satisfaction problems defined by excluded topological minors
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
New structural results on tetravalent half-arc-transitive graphs
The flip Markov chain for connected regular graphs
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
Planar minimally rigid graphs and pseudo-triangulations
Connected rigidity matroids and unique realizations of graphs
Congestion games viewed from M-convexity
A characterization of infinite planar primitive graphs
On the complexity of the approximation of nonplanarity parameters for cubic graphs
On enumerating the trees of the wheel and other special graphs
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

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5524326)