On the Principal Edge Tripartition of a Graph
From MaRDI portal
(Redirected from Publication:4173402)
Cited in
(42)- Bicycles and left-right tours in locally finite graphs
- Classification of knot projections
- On Tutte polynomials and cycles of plane graphs
- On the enumeration of a class of plane multigraphs
- Isotropic systems
- Balanced vertex weightings and arborescences
- On the evaluation at (3,3) of the Tutte polynomial of a graph
- On Tutte polynomials of matroids representable over GF(q)
- Local complementation and interlacement graphs
- Tutte-Martin polynomials and orienting vectors of isotropic systems
- On the number of 3-edge colorings of cubic graphs
- Generalized bicycles
- Interlace polynomials
- The Tutte polynomial of a morphism of matroids. III: Vectorial matroids
- Equivalence of edge bicolored graphs on surfaces
- Exploring the Tutte-Martin connection
- The interlace polynomial of graphs at \(-1\)
- Holes and dependences in an ordered complex
- Counterexamples to a conjecture of Las Vergnas
- Tri-partitions and bases of an ordered complex
- On the evaluation at ( - , ) of the Tutte polynomial of a binary matroid
- Parity, Eulerian subgraphs and the Tutte polynomial
- Curves on surfaces, charts, and words
- The Potts model and the Tutte polynomial.
- Embeddings of four-valent framed graphs into 2-surfaces
- Bicycles and Spanning Trees
- Tutte Polynomials and Bicycle Dimension of Ternary Matroids
- The adjacency matroid of a graph
- Interlace polynomials for multimatroids and delta-matroids
- On plane graphs with link component number equal to the nullity
- A polyhedral theory on graphs
- scientific article; zbMATH DE number 1369835 (Why is no real title available?)
- On the computational complexity of the Jones and Tutte polynomials
- Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case
- Zeros of Jones polynomials of graphs
- Knots, matroids and the Ising model
- A parity result of Fraysseix, computational complexity of Tutte polynomials, and a conjecture on planar graphs
- Dirac traces and the Tutte polynomial
- The interlace polynomial of a graph
- A generalization to bases common to r binary matroids of the weighted matrix-tree theorem in the case when the weights are Boolean
- A characterization of circle graphs
- Spanning trees, Euler tours, medial graphs, left-right paths and cycle spaces
This page was built for publication: On the Principal Edge Tripartition of a Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4173402)