Geodesic
Recognition of chordal graphs and cographs which are Cover-Incomparability graphs
Discrete mathematics & theoretical computer science, Tome 26 (2024) no. 3.

Voir la notice de l'article provenant de la source Episciences

Cover-Incomparability graphs (C-I graphs) are an interesting class of graphs from posets. A C-I graph is a graph from a poset $P=(V,\le)$ with vertex set $V$, and the edge-set is the union of edge sets of the cover graph and the incomparability graph of the poset. The recognition of the C-I graphs is known to be NP-complete (Maxov\'{a} et al., Order 26(3), 229--236(2009)). In this paper, we prove that chordal graphs having at most two independent simplicial vertices are exactly the chordal graphs which are also C-I graphs. A similar result is obtained for cographs as well. Using the structural results of these graphs, we derive linear time recognition algorithms for chordal graphs and cographs which are C-I graphs.
DOI : 10.46298/dmtcs.11657
Classification : 05C75, 05C85 
@article{DMTCS_2024_26_3_a8,
     author = {Anil, Arun and Changat, Manoj},
     title = {Recognition of chordal graphs and cographs which are {Cover-Incomparability} graphs},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {26},
     number = {3},
     year = {2024},
     doi = {10.46298/dmtcs.11657},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.11657/}
}
TY  - JOUR
AU  - Anil, Arun
AU  - Changat, Manoj
TI  - Recognition of chordal graphs and cographs which are Cover-Incomparability graphs
JO  - Discrete mathematics & theoretical computer science
PY  - 2024
VL  - 26
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.11657/
DO  - 10.46298/dmtcs.11657
LA  - en
ID  - DMTCS_2024_26_3_a8
ER  - 
%0 Journal Article
%A Anil, Arun
%A Changat, Manoj
%T Recognition of chordal graphs and cographs which are Cover-Incomparability graphs
%J Discrete mathematics & theoretical computer science
%D 2024
%V 26
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.11657/
%R 10.46298/dmtcs.11657
%G en
%F DMTCS_2024_26_3_a8
Anil, Arun; Changat, Manoj. Recognition of chordal graphs and cographs which are Cover-Incomparability graphs. Discrete mathematics & theoretical computer science, Tome 26 (2024) no. 3. doi : 10.46298/dmtcs.11657. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.11657/

Cité par Sources :