Circle graphs and the cycle double cover conjecture
From MaRDI portal
Publication:1025572
DOI10.1016/j.disc.2008.02.004zbMath1229.05168OpenAlexW2016874427WikidataQ123299147 ScholiaQ123299147MaRDI QIDQ1025572
Publication date: 19 June 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.02.004
cycle double covertransition systemlocal complementationcircle graphinterlace polynomialcompatibility conjecture
Related Items
Generation and properties of snarks ⋮ On the linear algebra of local complementation ⋮ Compatible circuit decompositions of 4‐regular graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A two-variable interlace polynomial
- Transforming eulerian trails
- The interlace polynomial of a graph
- Reducing prime graphs and recognizing circle graphs
- An upper bound for the number of Eulerian orientations of a regular graph
- A characterisation of graphs having three pariwise compatible Euler tours
- Interlace polynomials
- Identities for circuit partition polynomials, with applications to the Tutte polynomial
- New results for the Martin polynomial
- Circuit decompositions of Eulerian graphs
- Exploring the Tutte-Martin connection
- Evaluations of the circuit partition polynomial
- Rank-width and vertex-minors
- Graph polynomials derived from Tutte-Martin polynomials
- Le Polynôme De Martin D'un Graphe Eulerien
- An O(n2) Algorithm for Undirected Split Decomposition
- Compatible circuit decompositions of 4‐regular graphs