A study on oriented relative clique number
From MaRDI portal
Publication:1752681
DOI10.1016/j.disc.2018.04.001zbMath1387.05085OpenAlexW2802795677WikidataQ129905425 ScholiaQ129905425MaRDI QIDQ1752681
Swathy Prabhu, Sagnik Sen, Sandip Das
Publication date: 24 May 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2018.04.001
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)
Related Items (4)
On relative clique number of triangle-free planar colored mixed graphs ⋮ Triangle-free projective-planar graphs with diameter two: domination and characterization ⋮ Colourings of oriented connected cubic graphs ⋮ On clique numbers of colored mixed graphs
Cites Work
- Unnamed Item
- Homomorphisms and colourings of oriented graphs: an updated survey
- On oriented relative clique number
- Homomorphism bounds for oriented planar graphs of given minimum girth
- Oriented colorings of triangle-free planar graphs
- Good and semi-strong colorings of oriented planar graphs
- The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
- Light subgraphs of graphs embedded in the plane. A survey
- Outerplanar and Planar Oriented Cliques
- Acyclic and oriented chromatic numbers of graphs
- The chromatic number of oriented graphs
- Analogues of cliques for oriented coloring
This page was built for publication: A study on oriented relative clique number