On the Principal Edge Tripartition of a Graph
DOI10.1016/S0167-5060(08)70508-9zbMATH Open0392.05059OpenAlexW1492445835MaRDI QIDQ4173402FDOQ4173402
Ronald C. Read, Pierre Rosenstiehl
Publication date: 1978
Published in: Advances in Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-5060(08)70508-9
GaussWalkPlanarConnected GraphPlanar GraphsAlgebraic BipartitionsAlgebraic DiagonalAlgebraic TripartitionBicycle AnalysisClosed CurveCocycle SpaceCrossingsCycle SpacesInterlace GraphsPoints of Self- IntersectionPrincipal Edge Tripartition of a Graph
Cited In (41)
- The adjacency matroid of a graph
- Interlace polynomials for multimatroids and delta-matroids
- Curves on surfaces, charts, and words
- Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case
- Title not available (Why is that?)
- Tutte Polynomials and Bicycle Dimension of Ternary Matroids
- On the evaluation at \(( - \iota ,\iota )\) of the Tutte polynomial of a binary matroid
- The interlace polynomial of a graph
- The interlace polynomial of graphs at \(-1\)
- Balanced vertex weightings and arborescences
- Bicycles and left-right tours in locally finite graphs
- Isotropic systems
- Tutte-Martin polynomials and orienting vectors of isotropic systems
- Holes and dependences in an ordered complex
- On plane graphs with link component number equal to the nullity
- On the evaluation at (3,3) of the Tutte polynomial of a graph
- Interlace polynomials
- On Tutte polynomials of matroids representable over \(GF(q)\)
- Equivalence of edge bicolored graphs on surfaces
- Counterexamples to a conjecture of Las Vergnas
- On the number of 3-edge colorings of cubic graphs
- Classification of knot projections
- Knots, matroids and the Ising model
- A parity result of Fraysseix, computational complexity of Tutte polynomials, and a conjecture on planar graphs
- A characterization of circle graphs
- Embeddings of Four-valent Framed Graphs into 2-surfaces
- Local complementation and interlacement graphs
- Bicycles and Spanning Trees
- Generalized bicycles
- Exploring the Tutte-Martin connection
- Zeros of Jones polynomials of graphs
- The Potts model and the Tutte polynomial.
- A generalization to bases common to r binary matroids of the weighted matrix-tree theorem in the case when the weights are Boolean
- Parity, Eulerian subgraphs and the Tutte polynomial
- On Tutte polynomials and cycles of plane graphs
- Tri-partitions and bases of an ordered complex
- Spanning trees, Euler tours, medial graphs, left-right paths and cycle spaces
- A polyhedral theory on graphs
- The Tutte polynomial of a morphism of matroids. III: Vectorial matroids
- On the computational complexity of the Jones and Tutte polynomials
- On the enumeration of a class of plane multigraphs
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)