Difference of forbidden pairs containing a claw

Guantao Chen; Michitaka Furuya; Songling Shan; Shoichi Tsuchiya; Ping Yang

Difference of forbidden pairs containing a claw

Combinatorics 2015-05-05 v1

Authors: Guantao Chen , Michitaka Furuya , Songling Shan , Shoichi Tsuchiya , Ping Yang

Abstract

When we study forbidden subgraph conditions guaranteeing graphs to have some properties, a claw (or $K_{1,3}$ ) 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.

Keywords

graph theory

Cite

@article{arxiv.1505.00386,
  title  = {Difference of forbidden pairs containing a claw},
  author = {Guantao Chen and Michitaka Furuya and Songling Shan and Shoichi Tsuchiya and Ping Yang},
  journal= {arXiv preprint arXiv:1505.00386},
  year   = {2015}
}

Comments

21 pages, 6 figures

Related papers

View all related →

Data Structures and Algorithms · Computer Science

Graph Isomorphism for Graph Classes Characterized by two Forbidden Induced Subgraphs