Optimal strong parity edge-coloring of complete graphs
From MaRDI portal
Recommendations
Cites work
- B-valuations of graphs
- A note on the Hopf-Stiefel function
- Additive number theory sheds extra light on the Hopf-Stiefel \(\circ\) function.
- Combinatorial Nullstellensatz
- scientific article; zbMATH DE number 5066400 (Why is no real title available?)
- scientific article; zbMATH DE number 5237271 (Why is no real title available?)
- Nonrepetitive colorings of graphs
- Old and new formulas for the Hopf-Stiefel and related functions
- On a hypergraph Turán problem of Frankl
- Orthogonal pairings of Euclidean spaces
- Sums in the grid
- Sumsets in vector spaces over finite fields
- Über Richtungsfelder in den projektiven Räumen und einen Satz aus der reellen Algebra
Cited in
(10)- Alternating walks in partially 2-edge-colored graphs and optimal strength of graph labeling
- On vertex-parity edge-colorings
- Parity and strong parity edge-colorings of graphs
- Improved bound on facial parity edge coloring
- Facial parity edge colouring of plane pseudographs
- Facial parity 9-edge-coloring of outerplane graphs
- scientific article; zbMATH DE number 5237271 (Why is no real title available?)
- 1-planar graphs are odd 13-colorable
- Parity vertex colouring of plane graphs
- Strong parity edge-colorings of graphs
This page was built for publication: Optimal strong parity edge-coloring of complete graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1046737)
