Graph classes characterized both by forbidden subgraphs and degree sequences

@article{Barrus2008GraphCC,
  title={Graph classes characterized both by forbidden subgraphs and degree sequences},
  author={Michael D. Barrus and Mohit Kumbhat and Stephen G. Hartke},
  journal={Journal of Graph Theory},
  year={2008},
  volume={57},
  pages={131-148}
}
Given a set F of graphs, a graph G is F-free if G does not contain any member of F as an induced subgraph. We say that F is a degree-sequence-forcing set if, for each graph G in the class C of F-free graphs, every realization of the degree sequence of G is also in C. We give a complete characterization of the degree-sequence-forcing sets F when F has cardinality at most two. Mathematics Subject Classification (2000): 05C75, 05C07 

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
8 Extracted Citations
21 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 21 references

On split graphs and some related questions

  • S. Földes, P. L. Hammer
  • Problèmes Combinatoires et Théorie Des Graphes…
  • 1976
Highly Influential
5 Excerpts

Urbanovich , 2matroid graphs and power sequences

  • P. O.
  • Vestsi Akad Navuk BSSR Ser FizMat Navuk
  • 2004

Tyshkevich , On forcibly hereditary Pgraphical sequences

  • Zh. A. Chernyak, I. R.
  • Discrete Math
  • 1987

Similar Papers

Loading similar papers…