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)- Combinatorial theory of the semiclassical evaluation of transport moments II: Algorithmic approach for moment generating functions
- Refining a tree-decomposition which distinguishes tangles
- Partial duality for ribbon graphs. III: A gray code algorithm for enumeration
- Canonical tree-decompositions of finite graphs. II. Essential parts
- Parallel connections and coloured Tutte polynomials
- The quadrangulation conjecture for orientable surfaces
- scientific article; zbMATH DE number 3020563 (Why is no real title available?)
- Distributions of near-4-regular maps on the sphere and the projective plane
- An elementary proof of a matrix tree theorem for directed graphs
- Detecting cycles through three fixed vertices in a graph
- Formal specification and proofs for the topology and classification of combinatorial surfaces
- The adjacency matroid of a graph
- The smooth structure of the moduli space of a weighted series-parallel graph
- The structure of the models of decidable monadic theories of graphs
- Graphs that admit square 1-factorizations are hamiltonian Cayley graphs
- Connectivity and tree structure in finite graphs
- Oriented hypergraphic matrix-tree type theorems and bidirected minors via Boolean order ideals
- Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs
- A note on certain de Bruijn sequences with forbidden subsequences
- Quasigroup associativity and biased expansion graphs
- I/O-efficient algorithms for graphs of bounded treewidth
- Partial duality of hypermaps
- scientific article; zbMATH DE number 5601298 (Why is no real title available?)
- Inequivalent factorizations of permutations
- scientific article; zbMATH DE number 1359491 (Why is no real title available?)
- scientific article; zbMATH DE number 874369 (Why is no real title available?)
- Tensor networks and the enumerative geometry of graphs
- A tight lower bound on the maximum genus of 3-edge connected loopless graphs
- Phased graphs and graph energies
- Enumeration of 2-connected loopless 4-regular maps on the plane
- Counting 2-connected 4-regular maps on the projective plane
- Strongly linear trend-free block designs and 1-factors of representative graphs
- Counting cliques in 1-planar graphs
- Introduction
- On recent trends in discrete geometry in computer science
- The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs
- Computing with graph rewriting systems with priorities
- An intuitionistic proof of a discrete form of the Jordan curve theorem formalized in Coq with combinatorial hypermaps
- Hamiltonian properties of locally connected graphs with bounded vertex degree
- The category of node-and-choice preforms for extensive-form games
- Polynomial invariants of graphs. II
- The monadic second-order logic of graphs. XII: Planar graphs and planar maps
- Canonical tree-decompositions of finite graphs. I: Existence and algorithms.
- Exact Potts model partition functions on strips of the honeycomb lattice
- Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
- Growth rates of groups associated with face 2-coloured triangulations and directed Eulerian digraphs on the sphere
- An introduction to the k-defect polynomials
- Nonlinear dynamics of networks: the groupoid formalism
- Subdivisions de surfaces et cartes généralisées de dimension 2
- Topological graph polynomials in colored group field theory
- Inapproximability of the Tutte polynomial
- Homology of cellular structures allowing multi-incidence
- The construction and classification of self-dual spherical polyhedra
- Exact Potts model partition functions on wider arbitrary-length strips of the square lattice
- Structure and enumeration of two-connected graphs with prescribed three-connected components
- The number of Euler tours of random directed graphs
- General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
- On inverse topology problem for Laplace operators on graphs
- Vertices of Localized Imbalance in a Biased Graph
- Triangulations of the sphere, bitrades and abelian groups
- Discrete mathematics: graphs, networks, applications
- Upon the removal of the edges of a 1-factor from an even circuit in a 2-connected graph
- The monadic second-order logic of graphs. XI: Hierarchical decompositions of connected graphs
- Partial duality for ribbon graphs. I: distributions
- Techniques in matroid reconstruction
- Global dynamics and bifurcation analysis of an insect-borne plant disease model with two transmission routes
- A rooted map invariant, non-orientability and Jack symmetric functions
- Extending the Tutte and Bollobás–Riordan polynomials to rank 3 weakly coloured stranded graphs
- On some factor theorems of graphs
- Reducible chains in several types of 2-connected graphs
- A Dichromatic Polynomial for Weighted Graphs and Link Polynomials
- Acyclic orientations and the chromatic polynomial
- The KP hierarchy, branched covers, and triangulations
- Maximum genus, girth and connectivity
- On the sandpile group of dual graphs
- A little statistical mechanics for the graph theorist
- A combinatorial relationship between Eulerian maps and hypermaps in orientable surfaces
- Distributive lattice structure on the set of perfect matchings of carbon nanotubes
- The painter's problem: covering a grid with colored connected polygons
- Pre-Regge calculus: Topology via logic
- Advanced graph theory and combinatorics
- Fusion graphs: merging properties and watersheds
- Generating the cycle space of planar graphs
- A new proof of the Gauss interlace conjecture
- Bounds for the coefficients of flow polynomials
- Universal Tutte polynomial
- Dual graphs and knot invariants
- 4-edge-connected 4-regular maps on the projective plane
- Dispersal routes reconstruction and the minimum cost arborescence problem
- Near-central permutation factorization and Strahov's generalized Murnaghan-Nakayama rule
- Isospectral flows preserving some centrosymmetric structures
- Maximum genus and connectivity
- Combinatorial theory of the semiclassical evaluation of transport moments. I: Equivalence with the random matrix approach
- An optimal parallel algorithm for planar cycle separators
- Comparing Wiener, Szeged and revised Szeged index on cactus graphs
- Negative (and positive) circles in signed graphs: a problem collection
- Topological graph polynomial and quantum field theory. II: Mehler kernel theories
- Decompositions of signed-graphic matroids
- Elements of a theory of simulation. II: Sequential dynamical systems.
- Plane elementary bipartite 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)
