Notes on weak-odd edge colorings of digraphs
From MaRDI portal
Publication:5090189
Recommendations
Cites work
- scientific article; zbMATH DE number 426361 (Why is no real title available?)
- scientific article; zbMATH DE number 3150485 (Why is no real title available?)
- scientific article; zbMATH DE number 3013308 (Why is no real title available?)
- A note on weak odd edge-colorings of graphs
- Colouring vertices of plane graphs under restrictions given by faces
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Digraphs
- Facial parity edge colouring of plane pseudographs
- Graph theory
- Paths, Trees, and Flowers
- The Theory of Round Robin Tournaments
- Unique-maximum and conflict-free coloring for hypergraphs and tree graphs
- Weak-odd edge-coloring of digraphs
Cited in
(3)
This page was built for publication: Notes on weak-odd edge colorings of digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090189)