scientific article; zbMATH DE number 3882430

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Combinatorial aspects of matroids and geometric lattices (05B35) Graph theory (05Cxx)

Recommendations

Graph theory. Foreword by Crispin St. J. A. Nash-Williams.
Foreword to the special focus on graph theory and applications
Graph theory. An introduction to proofs, algorithms, and applications
A textbook of graph theory
A textbook of graph theory
Preface: Graph theory and combinatorics
scientific article; zbMATH DE number 6476473
Graph theory. A problem oriented approach
Graph theory. A problem oriented approach

Cited in

(only showing first 100 items - show all)

Maximum genus, girth and connectivity
Combinatorial theory of the semiclassical evaluation of transport moments II: Algorithmic approach for moment generating functions
Minor-equivalence for infinite graphs
Decompositions of signed-graphic matroids
Packing non-zero \(A\)-paths in an undirected model of group labeled graphs
Removable edges in a 5-connected graph and a construction method of 5-connected graphs
Simulation of the quasi-static mechanics and scalar transport properties of ideal granular assemblages
Detecting cycles through three fixed vertices in a graph
On removable even circuits in graphs
Relational networks of conditional preferences
Fusion graphs: merging properties and watersheds
scientific article; zbMATH DE number 3993640 (Why is no real title available?)
A new proof of the Gauss interlace conjecture
Dynamic planar embeddings of dynamic graphs
I/O-efficient algorithms for graphs of bounded treewidth
The painter's problem: covering a grid with colored connected polygons
The non-solvability by radicals of generic 3-connected planar Laman graphs
Tension-flow polynomials on graphs
Realizations of branched self-coverings of the 2-sphere
Techniques in matroid reconstruction
Isospectral flows that preserve matrix structure
Construction of Voronoi diagrams in the plane by using maps
Hamiltonian knot projections and lengths of thick knots.
Subtraction-free complexity, cluster transformations, and spanning trees
Tensor networks and the enumerative geometry of graphs
Paths and cycles concerning independence edges
Exact Potts model partition functions on strips of the honeycomb lattice
Partial duality for ribbon graphs. III: A gray code algorithm for enumeration
Graphs that admit square 1-factorizations are hamiltonian Cayley graphs
Optimal parallel algorithms for path problems on planar graphs
PARTITION FUNCTION ZEROS OF A RESTRICTED POTTS MODEL ON SELF-DUAL STRIPS OF THE SQUARE LATTICE
Ground state entropy of Potts antiferromagnets on cyclic polygon chain graphs
Quasigroup associativity and biased expansion graphs
Parallel connections and coloured Tutte polynomials
Chromatic polynomials of homeomorphism classes of graphs
Maximum genus and connectivity
Cubic combinatorial maps
Isospectral flows preserving some centrosymmetric structures
Euclidean minima of totally real number fields: Algorithmic determination
On some factor theorems of graphs
Restricted non-separable planar maps and some pattern avoiding permutations
Merging in maps and in pavings
Routing properties of supercubes
Genus expansion for real Wishart matrices
All wheels with two missing consecutive spokes are chromatically unique
Connectivity in frame matroids
Reducible chains in several types of 2-connected graphs
Strongly linear trend-free block designs and 1-factors of representative graphs
Structural properties of Potts model partition functions and chromatic polynomials for lattice strips
Memory efficient algorithms for cactus graphs and block graphs
Annular embeddings of permutations for arbitrary genus
Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra
Vertices of Localized Imbalance in a Biased Graph
The monadic second-order logic of graphs. XI: Hierarchical decompositions of connected graphs
A Greedoid Polynomial Which Distinguishes Rooted Arborescences
Decomposition formulas for the flow polynomial
The monadic second-order logic of graphs. XII: Planar graphs and planar maps
A note on certain de Bruijn sequences with forbidden subsequences
Polynomials associated with nowhere-zero flows
The cactus tree of a metric space
Partial duality of hypermaps
Partial duality for ribbon graphs. I: distributions
Pre-Regge calculus: Topology via logic
The KP hierarchy, branched covers, and triangulations
Exact Potts model partition functions on wider arbitrary-length strips of the square lattice
Sequential Monte Carlo for Sampling Balanced and Compact Redistricting Plans
Asymmetric Abelian sandpile models
Enumeration of 2-connected loopless 4-regular maps on the plane
Milnor numbers, spanning trees, and the Alexander-Conway polynomial.
The spectrum of the Hilbert space valued second derivative with general self-adjoint boundary conditions
On the sandpile group of dual graphs
Phased graphs and graph energies
The number of Euler tours of random directed graphs
Topological graph polynomial and quantum field theory. II: Mehler kernel theories
Canonical tree-decompositions of finite graphs. I: Existence and algorithms.
Inequivalent representations of ternary matroids
Growth rates of groups associated with face 2-coloured triangulations and directed Eulerian digraphs on the sphere
A little statistical mechanics for the graph theorist
General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
The double reconstruction conjecture about finite colored hypergraphs
\(K_{6}\) minors in 6-connected graphs of bounded tree-width
Treewidth computations. I: Upper bounds
Counting 2-connected 4-regular maps on the projective plane
A Dichromatic Polynomial for Weighted Graphs and Link Polynomials
A combinatorial relationship between Eulerian maps and hypermaps in orientable surfaces
Bounds for the coefficients of flow polynomials
Formal specification and proofs for the topology and classification of combinatorial surfaces
The adjacency matroid of a graph
Elements of a theory of simulation. II: Sequential dynamical systems.
Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
A rooted map invariant, non-orientability and Jack symmetric functions
Near-central permutation factorization and Strahov's generalized Murnaghan-Nakayama rule
A pattern for the asymptotic number of rooted maps on surfaces
Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees
A generalized Beraha conjecture for non-planar graphs
An intuitionistic proof of a discrete form of the Jordan curve theorem formalized in Coq with combinatorial hypermaps
Plane elementary bipartite graphs
On some putative graph-theoretic counterexamples to the principle of the identity of indiscernibles
An algorithm for constructing star-shaped drawings of plane graphs
On terminal forms for topological polynomials for ribbon graphs: the \(N\)-petal flower

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 Q3216652)