Outerplanar and Planar Oriented Cliques - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Graph Theory Année : 2015

Outerplanar and Planar Oriented Cliques

Résumé

The clique number of an undirected graph G is the maximum order of a complete subgraph of G and is a well-known lower bound for the chromatic number of G. Every proper k-coloring of G may be viewed as a homomorphism (an edge-preserving vertex mapping) of G to the complete graph of order k. By considering homomorphisms of oriented graphs (digraphs without cycles of length at most 2), we get a natural notion of (oriented) colorings and oriented chromatic number of oriented graphs. An oriented clique is then an oriented graph whose number of vertices and oriented chromatic number coincide. However, the structure of oriented cliques is much less understood than in the undirected case. In this article, we study the structure of outerplanar and planar oriented cliques. We first provide a list of 11 graphs and prove that an outerplanar graph can be oriented as an oriented clique if and only if it contains one of these graphs as a spanning subgraph. Klostermeyer and MacGillivray conjectured that the order of a planar oriented clique is at most 15, which was later proved by Sen. We show that any planar oriented clique on 15 vertices must contain a particular oriented graph as a spanning subgraph, thus reproving the above conjecture. We also provide tight upper bounds for the order of planar oriented cliques of girth k for all inline image.
Fichier non déposé

Dates et versions

hal-01330534 , version 1 (11-06-2016)

Identifiants

  • HAL Id : hal-01330534 , version 1

Citer

Eric Sopena, Sagnik Sen, Ayan Nandy. Outerplanar and Planar Oriented Cliques. Journal of Graph Theory, 2015, 82 (2), pp.165-193. ⟨hal-01330534⟩

Collections

CNRS TDS-MACS ANR
46 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More