Difference of forbidden pairs containing a claw
Guantao Chen, Michitaka Furuya, Songling Shan, Shoichi Tsuchiya, Ping, Yang
TL;DR
This paper characterizes three new classes of graphs defined by forbidden pairs containing a claw, and applies these characterizations to solve related forbidden subgraph problems.
Contribution
It provides new characterizations of graph classes with forbidden pairs involving a claw, extending previous work and enabling applications to subgraph problems.
Findings
Characterization of three new graph classes with forbidden pairs containing a claw
Applications to forbidden subgraph problems
Extension of previous classifications by Furuya and Tsuchiya
Abstract
When we study forbidden subgraph conditions guaranteeing graphs to have some properties, a claw (or ) frequently appears as one of forbidden subgraphs. Recently, Furuya and Tsuchiya compared two classes generated by different forbidden pairs containing a claw, and characterized one of such classes. In this paper, we give such characterization for three new classes. Furthermore, we give applications of our characterizations to some forbidden subgraph problems.
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 · Limits and Structures in Graph Theory · graph theory and CDMA systems