Notes on weak-odd edge colorings of digraphs
From MaRDI portal
Publication:5090189
DOI10.26493/1855-3974.1955.1CDzbMATH Open1493.05103OpenAlexW3191650367MaRDI QIDQ5090189FDOQ5090189
Authors: César Hernández-Cruz, Mirko Petruševski, Riste Škrekovski
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
Recommendations
Cites Work
- Graph theory
- Paths, Trees, and Flowers
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- A note on weak odd edge-colorings of graphs
- Digraphs
- Title not available (Why is that?)
- The Theory of Round Robin Tournaments
- Title not available (Why is that?)
- Title not available (Why is that?)
- Facial parity edge colouring of plane pseudographs
- Colouring vertices of plane graphs under restrictions given by faces
- 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)