Parity and strong parity edge-colorings of graphs
From MaRDI portal
Publication:1928503
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
- Embedding Trees in a Hypercube is NP-Complete
- scientific article; zbMATH DE number 5237271 (Why is no real title available?)
- Old and new formulas for the Hopf-Stiefel and related functions
- Optimal strong parity edge-coloring of complete graphs
- 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)- Parity and disparity subgraphs
- Optimal strong parity edge-coloring of complete graphs
- Alternating walks in partially 2-edge-colored graphs and optimal strength of graph labeling
- On vertex-parity edge-colorings
- On the parity of colourings and flows
- A characterization for graphs having strong parity factors
- Odd graph and its applications to the strong edge coloring
- Even edge colorings of a graph
- Parity vertex colouring of plane graphs
- Strong parity edge-colorings of graphs
This page was built for publication: Parity and strong parity edge-colorings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1928503)