Some common properties for regulizable graphs, edge-critical graphs and B-graphs

@inproceedings{Berge1980SomeCP,
  title={Some common properties for regulizable graphs, edge-critical graphs and B-graphs},
  author={Claude Berge},
  booktitle={Graph Theory and Algorithms},
  year={1980}
}
The purpose of this paper is to display some relations between different classes of graphs, in particular: the edge-critical graphs, the well-covered graphs ("every maximal stable set is maximum"), the B-graphs ("each vertex is contained in some maximum stable set"), the regularizable graphs, the quasi-regularizable graphs. Though some of the proofs have already appeared somewhere else, we shall give them in full for the basic lemmas. No use of the Farkas lemma will be made (as for similar… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
21 Citations
9 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Combinatorial Properties of symmetric non-negative matricies

  • R. A. Brualdi
  • Coll. Th. Combinat° Rome,
  • 1976

Well coverd Graphs, I.I.T

  • G. Ravindra
  • Madras
  • 1976

On line-critical graphs, Infinite and finite sets, (North

  • L. Suranyi
  • 1975

On line-critical graphs, Thesis

  • A. George
  • 1971

Some covering concepts in Graphs

  • M. D. Plummer
  • J. Comb. Theory B
  • 1970

Une propriete des graphes k-stables critiques

  • C. Berge
  • Combinatorial Structures (Gordon and Breach, New…
  • 1970

On critical graphs, Th~orie des Graphes (Rome I.C.C.)

  • B. Andrasfal
  • 1967

On some properties of linear complexes, Math

  • A. A. Zykov
  • USSR Sb
  • 1949

Similar Papers

Loading similar papers…