scientific article; zbMATH DE number 3882430
From MaRDI portal
Publication:3216652
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)- 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
- Extending the Tutte and Bollobás–Riordan polynomials to rank 3 weakly coloured stranded graphs
- The structure of the models of decidable monadic theories of graphs
- Forest matrices around the Laplacian matrix
- Factorization index for completely positive graphs
- The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
- Canonical tree-decompositions of finite graphs. II. Essential parts
- Ghost symmetry and an analogue of Steinitz's theorem
- Conformal covariance of the Abelian sandpile height one field
- Dual graphs and knot invariants
- On the spectra of nonsymmetric Laplacian matrices
- Connectivity and tree structure in finite graphs
- Unimodular equivalence of graphs
- Hamiltonian properties of locally connected graphs with bounded vertex degree
- Nonlinear dynamics of networks: the groupoid formalism
- Polynomial invariants of graphs. II
- Topological graph polynomials in colored group field theory
- Zeros of the Jones polynomials for families of pretzel links
- Symmetries of unlabelled planar triangulations
- A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs
- Generalized activities and the Tutte polynomial
- General structural results for Potts model partition functions on lattice strips
- Inapproximability of the Tutte polynomial
- Exact Potts model partition function on strips of the triangular lattice
- Is the five-flow conjecture almost false?
- Triangulations of the sphere, bitrades and abelian groups
- scientific article; zbMATH DE number 1359491 (Why is no real title available?)
- scientific article; zbMATH DE number 874369 (Why is no real title available?)
- On the complexity of the independent set problem in triangle graphs
- Description trees and Tutte formulas.
- Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs
- Structure of Jackson integrals of \(BC_n\) type
- Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices
- The transition matroid of a 4-regular graph: an introduction
- Distributive lattice structure on the set of perfect matchings of carbon nanotubes
- Acyclic orientations and the chromatic polynomial
- The order of points on the second convex hull of a simple polygon
- Graphs with maximal induced matchings of the same size
- Hyperbolicity cones of elementary symmetric polynomials are spectrahedral
- The construction and classification of self-dual spherical polyhedra
- On the Query Complexity of Testing Orientations for Being Eulerian
- A linear-processor algorithm for depth-first search in planar graphs
- On triangulating \(k\)-outerplanar graphs
- scientific article; zbMATH DE number 3020563 (Why is no real title available?)
- Structure and enumeration of two-connected graphs with prescribed three-connected components
- scientific article; zbMATH DE number 53332 (Why is no real title available?)
- 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
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)