On complementarily transitivity of graphs

•We show that the Maximum Complementarily Transitivity Decision Problem is NP-complete for chordal graphs and bipartite graphs. We also show that the decision version of this problem is still NP-complete for two subclasses of bipartite graphs: star-convex bipartite graphs and perfect elimination bip...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 1058; p. 115582
Main Author:	Santra, Kamal
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 22.12.2025
Subjects:	Bipartite chain graphs Chordal graphs Complementarily transitivity Linear-time algorithms NP-completeness Star-convex bipartite graphs Star-convex bipartite graphs Bipartite chain graphs Complementarily transitivity Linear-time algorithms Chordal graphs NP-completeness
ISSN:	0304-3975
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!