Oriented incidence colourings of digraphs
From MaRDI portal
Publication:1630937
DOI10.7151/dmgt.2076zbMath1401.05109OpenAlexW2801104940MaRDI QIDQ1630937
Christopher Duffy, Pascal Ochem, Gary MacGillivray, Andre Raspaud
Publication date: 5 December 2018
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2076
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Some results on the incidence coloring number of a graph
- On the complexity of H-coloring
- On minimal graphs
- Color-families are dense
- On classes of relations and graphs determined by subobjects and factorobjects
- Every planar map is four colorable. II: Reducibility
- Incidence and strong edge colorings of graphs
- The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
- Homomorphisms and oriented colorings of equivalence classes of oriented graphs
- Incidence coloring of \(k\)-degenerated graphs
- Incidence coloring of regular graphs and complement graphs
- The \(C_{k}\)-extended graft construction
- Analogues of cliques for \((m,n)\)-colored mixed graphs
- Maximum Order of a Planar Oclique Is 15
- Acyclic and oriented chromatic numbers of graphs
- The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)
- The Complexity of Colouring by Semicomplete Digraphs
- Lower bounds for constant weight codes
- Homomorphism bounds for oriented planar graphs
- Oriented graph coloring