Notes on weak-odd edge colorings of digraphs
From MaRDI portal
Publication:5090189
DOI10.26493/1855-3974.1955.1cdzbMath1493.05103OpenAlexW3191650367MaRDI QIDQ5090189
César Hernández-Cruz, Riste Škrekovski, Mirko Petruševski
Publication date: 18 July 2022
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.26493/1855-3974.1955.1cd
Cites Work
- A note on weak odd edge-colorings of graphs
- Facial parity edge colouring of plane pseudographs
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Colouring vertices of plane graphs under restrictions given by faces
- Paths, Trees, and Flowers
- Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs
- Digraphs
- The Theory of Round Robin Tournaments
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Notes on weak-odd edge colorings of digraphs