parity edge coloring
milans.us · 3,178 words · saved by 1 readers
N/A
# link_1vzdss8d23x.pdf ## Metadata - PDFFormatVersion=1.4 - IsLinearized=false - IsAcroFormPresent=false - IsXFAPresent=false - IsCollectionPresent=false - IsSignaturesPresent=false - Producer=pdfTeX-1.10b - Creator=TeX - CreationDate=D:20061218145000 ## Contents ### Page 1 Optimal Parity Edge-Coloring of Complete GraphsDavid P. Bunde∗, Kevin Milans†, Douglas B. West‡, Hehui Wu§AbstractA parity walk in an edge-coloring of a graph is a walk along which each color is used an even number of times. Let p(G) be the least number of colors in an edge-coloring ofG having no parity path (a parity ed
saved by
related reading
- rainbow-turan-full-version.pdfpeople.maths.ox.ac.uk
- Rainbow Turán Problemspeople.math.ethz.ch
- [2604.04115] Gallai 3-colourings of random graphsarxiv.org
- Exact Stability for Turan's Theoremarxiv.org
- nullstellensatzweb.math.princeton.edu
- Sublinear expandersias.edu
- Forbidding Exactly One Hamming Distancearxiv.org
- [2604.27639] How large part of a graph can be covered by the neighborhoods of k vertices?arxiv.org
- Random Turán Problems for Graphs with a Vertex Complete to One Partarxiv.org
- piercing intervals - gyarfasarxiv.org
- Arborescences of Random Covering Graphsarxiv.org
- Induced rational exponents near twoarxiv.org