Combinatorial properties of the family of maximum stable sets of a graph-Reference-Cited by-同舟云学术

Combinatorial properties of the family of maximum stable sets of a graph

Published:2002-03 Issue:1-3 Volume:117 Page:149-161
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Levit Vadim E.,Mandrescu Eugen

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference13 articles.

1. Some common properties for regularizable graphs, edge-critical graphs and B-graphs;Berge,1981

2. Independence numbers of graphs—an extension of the König–Egerváry theorem;Deming;Discrete Math.,1979

3. On combinatorial properties of matrices;Egerváry;Matematikai Lapok,1931

4. Graphs whose vertex independence number is unaffected by single edge addition or deletion;Gunther;Discrete Appl. Math.,1993

5. Changing and unchanging of the graphical invariants: minimum and maximum degree, maximum clique size, node independence number and edge independence number;Haynes;Congr. Numer.,1990

Cited by 23 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Critical sets, crowns and local maximum independent sets;Journal of Global Optimization;2021-10-23

2. On an annihilation number conjecture;Ars Mathematica Contemporanea;2020-10-23

3. On the critical difference of almost bipartite graphs;Journal of Algebraic Combinatorics;2020-09-04

4. Nullspace vertex partition in graphs;Journal of Combinatorial Optimization;2020-07-22

5. Critical and Maximum Independent Sets Revisited;Mathematical Optimization Theory and Operations Research;2019