Circuit partitions and signed interlacement in 4-regular graphs
DOI:
https://doi.org/10.55016/ojs/cdm.v20i2.62407Keywords:
4-regular graph, circuit partition, cycle space, Euler system, interlacementAbstract
Let $F$ be a 4-regular graph. Each circuit partition $P$ of $F$ has a corresponding touch-graph $Tch(P)$; the circuits in $P$ correspond to vertices of $Tch(P)$, and the vertices of $F$ correspond to edges of $Tch(P)$. We discuss the connection between modified versions of the interlacement matrix of an Euler system of $F$ and the cycle space of $Tch(P)$, over $GF(2)$ and $\mathbb{R}$.
Downloads
References
interlace polynomial of a graph}, J. Combin. Theory Ser. B \textbf{92} (2004), 199-233.
\bibitem {A}R. Arratia, B. Bollob\'{a}s, and G. B. Sorkin, \emph{A
two-variable interlace polynomial}, Combinatorica \textbf{24} (2004), 567-584.
\bibitem {Be}I. Beck, \emph{Cycle decomposition by transpositions}, J. Combin.
Theory Ser. A \textbf{23} (1977), 198-207.
\bibitem {BM}I. Beck and G. Moran, \emph{Introducing disjointness to a
sequence of transpositions}, Ars Combin. \textbf{22} (1986), 145-153.
\bibitem {B}B. Bollob\'{a}s, \textit{Modern Graph Theory}, Springer-Verlag,
New York, 1998.
\bibitem {Bold}A. Bouchet, \emph{Caract\'{e}risation des symboles crois\'{e}s
de genre nul}, C. R. Acad. Sci. Paris S\'{e}r. A-B \textbf{274} (1972), A724-A727.
\bibitem {Bi1}A. Bouchet, \emph{Isotropic systems}, European J. Combin.
\textbf{8} (1987), 231-244.
\bibitem {Bi2}A. Bouchet, \emph{Graphic presentation of isotropic systems}, J.
Combin. Theory Ser. B \textbf{45} (1988), 58-76.
\bibitem {Bu}A. Bouchet, \emph{Unimodularity and circle graphs}, Discrete
Math. \textbf{66} (1987), 203-208.
\bibitem {Br}H. R. Brahana, \emph{Systems of circuits on two-dimensional
manifolds}, Ann. Math. \textbf{23} (1921), 144-168.
\bibitem {CL}M. Cohn and A. Lempel, \emph{Cycle decomposition by disjoint
transpositions}, J. Combin. Theory Ser. A \textbf{13} (1972), 83-89.
\bibitem {GS}Q.\ Ge and D.\ \v{S}tefankovi\v{c}, \emph{The complexity of
counting Eulerian tours in 4-regular graphs}, Algorithmica \textbf{63} (2012), 588--601.
\bibitem {J1}F. Jaeger, \emph{On some algebraic properties of graphs}, in:
\emph{Progress in Graph Theory} (Waterloo, Ont., 1982), Academic Press,
Toronto, 1984, pp. 347-366.
\bibitem {Jo}J. Jonsson, \emph{On the number of Euler trails in directed
graphs}, Math. Scand. \textbf{90} (2002), 191-214.
\bibitem {Kau}L. H. Kauffman, \emph{State models and the Jones polynomial},
Topology \textbf{26} (1987), 395-407.
\bibitem {KR}J. Keir and R. B. Richter, \emph{Walks through every edge exactly
twice II}, J. Graph Theory \textbf{21} (1996), 301-309.
\bibitem {K}A. Kotzig, \emph{Eulerian lines in finite 4-valent graphs and
their transformations}, in: \emph{Theory of Graphs} (Proc. Colloq., Tihany,
1966), Academic Press, New York, 1968, pp. 219-230.
\bibitem {L2}M. Las Vergnas, \emph{On Eulerian partitions of graphs}, in:
\emph{Graph Theory and Combinatorics} (Proc. Conf., Open Univ., Milton Keynes,
1978), Res. Notes in Math., 34, Pitman, Boston, Mass.-London, 1979, pp. 62--75.
\bibitem {L1}M. Las Vergnas, \emph{Eulerian circuits of 4-valent graphs
imbedded in surfaces}, in: \emph{Algebraic Methods in Graph Theory}, Vol. I,
II (Szeged, 1978), Colloq. Math. Soc. J\'{a}nos Bolyai, 25, North-Holland,
Amsterdam-New York, 1981, pp. 451--477.
\bibitem {L}M. Las Vergnas, \emph{Le polyn\^{o}me de Martin d'un graphe
Eul\'{e}rien}, Ann. Discrete Math. \textbf{17} (1983), 397-411.
\bibitem {Lau}J. Lauri, \emph{On a formula for the number of Euler trails for
a class of digraphs}, Discrete Math. \textbf{163} (1997), 307-312.
\bibitem {MP}N. Macris and J. V. Pul\'{e}, \emph{An alternative formula for
the number of Euler trails for a class of digraphs}, Discrete Math.
\textbf{154} (1996), 301-305.
\bibitem {Ma}P. Martin, \emph{Enum\'{e}rations eul\'{e}riennes dans les
multigraphes et invariants de Tutte-Grothendieck}, Th\`{e}se, Grenoble (1977).
\bibitem {Me}B.\ Mellor, \emph{A few weight systems arising from intersection
graphs}, Michigan Math. J. \textbf{51} (2003), 509-536.
\bibitem {M}G. Moran, \emph{Chords in a circle and linear algebra over GF(2)},
J. Combin. Theory Ser. A \textbf{37} (1984), 239-247.
\bibitem {P}P. A. Pevzner, \emph{DNA physical mapping and alternating Eulerian
cycles in colored graphs}, Algorithmica \textbf{13} (1995) 77-105.
\bibitem {RR}R. C. Read and P. Rosenstiehl, \emph{On the Gauss crossing
problem}, in: \emph{Combinatorics} (Proc. Fifth Hungarian Colloq., Keszthely,
1976), Vol. II, Colloq. Math. Soc. J\'{a}nos Bolyai, 18, North-Holland,
Amsterdam-New York, 1978, pp. 843-876.
\bibitem {R}R. B. Richter, \emph{Walks through every edge exactly twice}, J.
Graph Theory \textbf{18} (1994), 751-755.
\bibitem {So}E.\ Soboleva, \emph{Vassiliev knot invariants coming from Lie
algebras and 4-invariants}, J. Knot Theory Ramifications \textbf{10} (2001), 161-169.
\bibitem {S}S. Stahl, \emph{On the product of certain permutations}, European
J.\ Combin. \textbf{8} (1987), 69-72.
\bibitem {Tbn}L.\ Traldi, \emph{Binary nullity,\ Euler circuits and
interlacement polynomials}, European J. Combin. \textbf{32} (2011), 944-950.
\bibitem {T5}L. Traldi, \emph{On the linear algebra of local complementation},
Linear Alg. Appl. \textbf{436} (2012), 1072--1089.
\bibitem {Tnew}L. Traldi, \emph{Interlacement in 4-regular graphs: a new
approach using nonsymmetric matrices}, Contrib. Discrete Math. \textbf{9}
(2014), 85-97.
\bibitem {U}E. Ukkonen, \emph{Approximate string-matching with q-grams and
maximal matches}, Theoret. Comput. Sci. \textbf{92} (1992) 191-211.
\bibitem {Z}L.\ Zulli, \emph{A matrix for computing the Jones polynomial of a
knot}, Topology \textbf{34} (1995), 717-729.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Contributions to Discrete Mathematics
This work is licensed under a Creative Commons Attribution-NoDerivatives 4.0 International License.
This copyright statement was adapted from the statement for the University of Calgary Repository and from the statement for the Electronic Journal of Combinatorics (with permission).
The copyright policy for Contributions to Discrete Mathematics (CDM) is changed for all articles appearing in issues of the journal starting from Volume 15 Number 3.
Author(s) retain copyright over submissions published starting from Volume 15 number 3. When the author(s) indicate approval of the finalized version of the article provided by the technical editors of the journal and indicate approval, they grant to Contributions to Discrete Mathematics (CDM) a world-wide, irrevocable, royalty free, non-exclusive license as described below:
The author(s) grant to CDM the right to reproduce, translate (as defined below), and/or distribute the material, including the abstract, in print and electronic format, including but not limited to audio or video.
The author(s) agree that the journal may translate, without changing the content the material, to any medium or format for the purposes of preservation.
The author(s) also agree that the journal may keep more than one copy of the article for the purposes of security, back-up, and preservation.
In granting the journal this license the author(s) warrant that the work is their original work and that they have the right to grant the rights contained in this license.
The authors represent that the work does not, to the best of their knowledge, infringe upon anyone’s copyright.
If the work contains material for which the author(s) do not hold copyright, the author(s) represent that the unrestricted permission of the copyright holder(s) to grant CDM the rights required by this license has been obtained, and that such third-party owned material is clearly identified and acknowledged within the text or content of the work.
The author(s) agree to ensure, to the extent reasonably possible, that further publication of the Work, with the same or substantially the same content, will acknowledge prior publication in CDM.
The journal highly recommends that the work be published with a Creative Commons license. Unless otherwise arranged at the time the finalized version is approved and the licence granted with CDM, the work will appear with the CC-BY-ND logo. Here is the site to get more detail, and an excerpt from the site about the CC-BY-ND. https://creativecommons.org/licenses/
Attribution-NoDerivs
CC BY-ND
This license lets others reuse the work for any purpose, including commercially; however, it cannot be shared with others in adapted form, and credit must be provided to you.