| Title: | Mutually avoiding Eulerian circuits |
|---|
| Authors: | ID Erskine, Grahame (Author)
ID Griggs, Terry S. (Author)
ID Lewis, Robert (Author)
ID Tuite, James (Author) |
|---|
| Files: |  AMC_Erskine,_Griggs,_Lewis,_Tuite_2026.pdf (359,50 KB)
MD5: 71C3D2360C1EFB49304D566E6531C832
|
|---|
| Language: | English |
|---|
| Work type: | Article |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | ZUP - University of Primorska Press
|
|---|
| Abstract: | Two Eulerian circuits, both starting and ending at the same vertex, are avoiding if at every other point of the circuits they are at least distance 2 apart. An Eulerian graph which admits two such avoiding circuits starting from any vertex is said to be doubly Eulerian. The motivation for this definition is that the extremal Eulerian graphs, i.e. the complete graphs on an odd number of vertices and the cycles, are not doubly Eulerian. We prove results about doubly Eulerian graphs and identify those that are the “densest” and “sparsest” in terms of the number of edges. |
|---|
| Keywords: | Eulerian circuit, avoidance |
|---|
| Publication status: | Published |
|---|
| Publication version: | Version of Record |
|---|
| Publication date: | 01.07.2026 |
|---|
| Publisher: | Založba Univerze na Primorskem |
|---|
| Year of publishing: | 2026 |
|---|
| Number of pages: | 28 str. |
|---|
| Numbering: | Vol. 26, no. 3, [article no.] P3.09 |
|---|
| PID: | 20.500.12556/RUP-23521  |
|---|
| UDC: | 51 |
|---|
| eISSN: | 1855-3974 |
|---|
| DOI: | 10.26493/1855-3974.3220.12a |
|---|
| Publication date in RUP: | 20.08.2026 |
|---|
| Views: | 33 |
|---|
| Downloads: | 1 |
|---|
| Metadata: |    |
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
