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)

Fusion graphs: merging properties and watersheds
Structure of Jackson integrals of \(BC_n\) type
Testing planarity of geometric automorphisms in linear time
Structure and enumeration of two-connected graphs with prescribed three-connected components
An algorithm for constructing star-shaped drawings of plane graphs
Flows, flow-pair covers and cycle double covers
Cubic combinatorial maps
A linear-processor algorithm for depth-first search in planar graphs
Generalized activities and the Tutte polynomial
The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
Elementary divisors of graphs and matroids
On some factor theorems of graphs
Generalized activities and \(K\)-terminal reliability
Unimodular equivalence of graphs
Detecting cycles through three fixed vertices in a graph
Reducible chains in several types of 2-connected graphs
Pre-Regge calculus: Topology via logic
Computing with graph rewriting systems with priorities
Asymmetric Abelian sandpile models
On the rooted Tutte polynomial
A combinatorial relationship between Eulerian maps and hypermaps in orientable surfaces
Minor-equivalence for infinite graphs
Chromatic polynomials of homeomorphism classes of graphs
A pattern for the asymptotic number of rooted maps on surfaces
A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs
Generalized activities and K-terminal reliability. II
The random cluster process
Enumeration of 2-connected loopless 4-regular maps on the plane
Techniques in matroid reconstruction
Graph-theoretic interpretation of the generalized row sum method
The two-convex-polygons TSP: A solvable case
A monadic second-order definition of the structure of convex hypergraphs.
Zeros of the Jones polynomials for families of pretzel links
Milnor numbers, spanning trees, and the Alexander-Conway polynomial.
Tension-flow polynomials on graphs
Hamiltonian knot projections and lengths of thick knots.
Factorization index for completely positive graphs
The monadic second-order logic of graphs. XII: Planar graphs and planar maps
On the sandpile group of dual graphs
Elements of a theory of simulation. II: Sequential dynamical systems.
A new lower bound for the bipartite crossing number with applications
Maximum genus, girth and connectivity
Exact Potts model partition function on strips of the triangular lattice
Plane elementary bipartite graphs
All wheels with two missing consecutive spokes are chromatically unique
The category of node-and-choice preforms for extensive-form games
Negative (and positive) circles in signed graphs: a problem collection
On graphs whose flow polynomials have real roots only
Algorithm for identifying minimum driver nodes based on structural controllability
Network formation under linking constraints
Dynamic planar embeddings of dynamic graphs
Symmetries of unlabelled planar triangulations
Duality and the signed Laplacian matrix of a graph
Parallel connections and coloured Tutte polynomials
On the spectra of nonsymmetric Laplacian matrices
A new proof of the Gauss interlace conjecture
On graph invariants given by linear recurrence relations
Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
General structural results for Potts model partition functions on lattice strips
Polynomials associated with nowhere-zero flows
The quadrangulation conjecture for orientable surfaces
Description trees and Tutte formulas.
Forest matrices around the Laplacian matrix
A tight lower bound on the maximum genus of 3-edge connected loopless graphs
Upon the removal of the edges of a 1-factor from an even circuit in a 2-connected graph
On removable even circuits in graphs
The order of points on the second convex hull of a simple polygon
An optimal parallel algorithm for planar cycle separators
Simulation of the quasi-static mechanics and scalar transport properties of ideal granular assemblages
Graphs that admit square 1-factorizations are hamiltonian Cayley graphs
Maximum genus and connectivity
Inequivalent representations of ternary matroids
Polynomial invariants of graphs. II
Relational networks of conditional preferences
Graphs with no \(K_{3,3}\) minor containing a fixed edge
The monadic second-order logic of graphs. XI: Hierarchical decompositions of connected graphs
Dual graphs and knot invariants
Partial duality for ribbon graphs. I: distributions
Planar transitive graphs
Lehmer's question, graph complexity growth and links
Incidence hypergraphs: injectivity, uniformity, and matrix-tree theorems
Distributions of near-4-regular maps on the sphere and the projective plane
Characterizing attitudinal network graphs through frustration cloud
Metric graphs, cross ratios, and Rayleigh's laws
Trees and forests for nonequilibrium purposes: an introduction to graphical representations
Partial duality of hypermaps
Counting cliques in 1-planar graphs
Universality for polynomial invariants for ribbon graphs with half-ribbons
Universal Tutte polynomial
Tensor networks and the enumerative geometry of graphs
On abstraction in mathematics and indefiniteness in quantum mechanics
On zero-free intervals of flow polynomials
On the complexity of the independent set problem in triangle graphs
Oriented hypergraphic matrix-tree type theorems and bidirected minors via Boolean order ideals
On graphs having no flow roots in the interval \((1,2)\)
Generating the cycle space of planar graphs
Homology of cellular structures allowing multi-incidence
Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees
Signed-graphic matroids with all-graphic cocircuits
\(K_{6}\) minors in 6-connected graphs of bounded tree-width

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)