On nice and injective-nice tournaments
From MaRDI portal
Publication:2411588
DOI10.1016/j.disc.2017.06.006zbMath1372.05090OpenAlexW2742025611WikidataQ114190711 ScholiaQ114190711MaRDI QIDQ2411588
Publication date: 24 October 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2017.06.006
Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Oriented colorings of partial 2-trees
- On the oriented chromatic number of grids
- On the maximum average degree and the oriented chromatic number of a graph
- Colorings and girth of oriented planar graphs
- Injective Oriented Colourings
- Oriented graph coloring
- On nice graphs