On oriented relative clique number

DOI10.1016/J.ENDM.2015.07.017zbMath1347.05042OpenAlexW2221361075MaRDI QIDQ324737

Sagnik Sen, Sandip Das, Swathyprabhu Mj

Publication date: 17 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2015.07.017

zbMATH Keywords

planar graphsouterplanar graphsoriented graphsoriented chromatic numberoriented relative clique number

Mathematics Subject Classification ID

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 (3)

Unnamed Item ⋮ On relative clique number of triangle-free planar colored mixed graphs ⋮ A study on oriented relative clique number

Cites Work

• Homomorphism bounds for oriented planar graphs of given minimum girth
• 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
• Maximum Order of a Planar Oclique Is 15
• On the total coloring of planar graphs.
• The chromatic number of oriented graphs
• Analogues of cliques for oriented coloring

This page was built for publication: On oriented relative clique number