Optimal strong parity edge-coloring of complete graphs

DOI10.1007/s00493-008-2364-3zbMath1199.05105OpenAlexW2022762479MaRDI QIDQ1046737

David P. Bunde, Douglas B. West, Hehui Wu, Kevin G. Milans

Publication date: 28 December 2009

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-008-2364-3

zbMATH Keywords

complete graphsparity edge-coloringparity walk

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (6)

Improved bound on facial parity edge coloring ⋮ Parity and strong parity edge-colorings of graphs ⋮ 1-planar graphs are odd 13-colorable ⋮ Parity vertex colouring of plane graphs ⋮ Facial parity edge colouring of plane pseudographs ⋮ Facial parity 9-edge-coloring of outerplane graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A note on the Hopf-Stiefel function
• Orthogonal pairings of Euclidean spaces
• Sumsets in vector spaces over finite fields
• Sums in the grid
• Additive number theory sheds extra light on the Hopf-Stiefel \(\circ\) function.
• On a hypergraph Turán problem of Frankl
• Old and new formulas for the Hopf-Stiefel and related functions
• Über Richtungsfelder in den projektiven Räumen und einen Satz aus der reellen Algebra
• Combinatorial Nullstellensatz
• Nonrepetitive colorings of graphs
• $B$-valuations of graphs

This page was built for publication: Optimal strong parity edge-coloring of complete graphs