On the oriented achromatic number of graphs
From MaRDI portal
Publication:6202937
Recommendations
Cites work
- scientific article; zbMATH DE number 3843777 (Why is no real title available?)
- scientific article; zbMATH DE number 1341913 (Why is no real title available?)
- scientific article; zbMATH DE number 1341923 (Why is no real title available?)
- scientific article; zbMATH DE number 3298599 (Why is no real title available?)
- Achromatic numbers and graph operations
- Analogues of cliques for oriented coloring
- Chromatic polynomials of oriented graphs
- Complete oriented colourings and the oriented achromatic number
- Good and semi-strong colorings of oriented planar graphs
- Graph theory
- Minimal oriented graphs of diameter 2
- On fractional version of oriented coloring
- On the oriented chromatic index of oriented graphs
- On the oriented game chromatic number
- The chromatic number of oriented graphs
- The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
- Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs
This page was built for publication: On the oriented achromatic number of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6202937)