Parity and strong parity edge-colorings of graphs
From MaRDI portal
Publication:1928503
DOI10.1007/s10878-011-9398-yzbMath1261.05028OpenAlexW2084182857MaRDI QIDQ1928503
Hsiang-Chun Hsu, Gerard Jennhwa Chang
Publication date: 3 January 2013
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-011-9398-y
product of graphshypercube embedding(strong) parity edge-chromatic number(strong) parity edge-coloringHopt-Stiefel function
Hypergraphs (05C65) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- A note on the Hopf-Stiefel function
- Optimal strong parity edge-coloring of complete graphs
- 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.
- 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
- Embedding Trees in a Hypercube is NP-Complete
- Combinatorial Nullstellensatz
- $B$-valuations of graphs