Competition numbers of planar graphs

MaRDI QIDQ6270489zbMATH OpenFDO

Authors Jihoon Choi, Soogang Eoh, Suh-Ryung Kim

Publication date 15 February 2016

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Structural characterization of families of graphs (05C75)

Abstract: In this paper, we relate the competition number of a graph to its edge clique cover number by presenting a tight inequality $k(G)gehet{a}_e(G)-|V(G)|+widetildek(G)$ where $het{a}_e(G)$, $k(G)$, and $widetildek(G)$ are the edge clique cover number, the competition number, and the co-competition number of a graph $G$, respectively. By utilizing this inequality and a notion of competition-effective edge clique cover, we obtain some meaningful results on competition numbers of planar graphs.

This page was built for publication: Competition numbers of planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6270489)