Forbidden Subgraph Characterization of Quasi-line Graphs
Medha Dhurandhar
TL;DR
This paper characterizes quasi-line graphs using forbidden induced subgraphs and provides a necessary and sufficient condition for a graph to be a union of two cliques.
Contribution
It offers a new forbidden subgraph characterization of quasi-line graphs and a criterion for when a graph is a union of two cliques.
Findings
Characterization of quasi-line graphs via forbidden subgraphs
Necessary and sufficient condition for graphs to be unions of two cliques
New insights into the structure of quasi-line graphs
Abstract
Here in particular, we give a characterization of Quasi-line Graphs in terms of forbidden induced subgraphs. In general, we prove a necessary and sufficient condition for a graph to be a union of two cliques.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · graph theory and CDMA systems · Graph Labeling and Dimension Problems