A study on oriented relative clique number
From MaRDI portal
Recommendations
Cites work
- Acyclic and oriented chromatic numbers of graphs
- Analogues of cliques for oriented coloring
- Good and semi-strong colorings of oriented planar graphs
- Homomorphism bounds for oriented planar graphs of given minimum girth
- Homomorphisms and colourings of oriented graphs: an updated survey
- Light subgraphs of graphs embedded in the plane. A survey
- On oriented graphs with certain extension properties.
- On oriented relative clique number
- Oriented colorings of triangle-free planar graphs
- Outerplanar and planar oriented cliques
- The chromatic number of oriented graphs
- The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
Cited in
(11)- Analogues of cliques for oriented coloring
- On oriented relative clique number
- On relative clique number of triangle-free planar colored mixed graphs
- On coloring parameters of triangle-free planar \((n, m)\)-graphs
- The relative oriented clique number of triangle-free planar graphs is 10
- Colourings of oriented connected cubic graphs
- Outerplanar and planar oriented cliques
- Triangle-free projective-planar graphs with diameter two: domination and characterization
- Relative clique number of planar signed graphs
- Relative clique number of planar signed graphs
- On clique numbers of colored mixed graphs
This page was built for publication: A study on oriented relative clique number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1752681)