ON MAXIMAL INDEPENDENT SETS OF VERTICES IN CLAW-FREE GRAPHS

[1] BEINEKE LW, 1969, MANY FACES GRAPH THE, P45

[2] 2 THEOREMS IN GRAPH THEORY [J]. PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 1957, 43 (09) : 842 - 844

[3] Berge C., 1973, GRAPHS HYPERGRAPHS

[4] STRONGLY REGULAR GRAPHS, PARTIAL GEOMETRIES AND PARTIALLY BALANCED DESIGNS [J]. PACIFIC JOURNAL OF MATHEMATICS, 1963, 13 (02) : 389 - &

[5] Busacker R.G., 1965, FINITE GRAPHS NETWOR

[6] Charnes A., 1953, INTRO LINEAR PROGRAM

[7] PATHS TREES AND FLOWERS [J]. CANADIAN JOURNAL OF MATHEMATICS, 1965, 17 (03): : 449 - &

[8] MAXIMUM MATCHING AND A POLYHEDRON WITH O'1-VERTICES [J]. JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICS AND MATHEMATICAL, 1965, B 69 (1-2): : 125 - +

[9] EDMONDS J, OPTIMUM MATCHINGS

[10] CHARACTERIZATION OF COMPARABILITY GRAPHS + OF INTERVAL GRAPHS [J]. CANADIAN JOURNAL OF MATHEMATICS, 1964, 16 (03): : 539 - &

[1] BEINEKE LW, 1969, MANY FACES GRAPH THE, P45

[2] 2 THEOREMS IN GRAPH THEORY [J]. PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 1957, 43 (09) : 842 - 844

[3] Berge C., 1973, GRAPHS HYPERGRAPHS

[4] STRONGLY REGULAR GRAPHS, PARTIAL GEOMETRIES AND PARTIALLY BALANCED DESIGNS [J]. PACIFIC JOURNAL OF MATHEMATICS, 1963, 13 (02) : 389 - &

[5] Busacker R.G., 1965, FINITE GRAPHS NETWOR

[6] Charnes A., 1953, INTRO LINEAR PROGRAM

[7] PATHS TREES AND FLOWERS [J]. CANADIAN JOURNAL OF MATHEMATICS, 1965, 17 (03): : 449 - &

[8] MAXIMUM MATCHING AND A POLYHEDRON WITH O'1-VERTICES [J]. JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICS AND MATHEMATICAL, 1965, B 69 (1-2): : 125 - +

[9] EDMONDS J, OPTIMUM MATCHINGS

[10] CHARACTERIZATION OF COMPARABILITY GRAPHS + OF INTERVAL GRAPHS [J]. CANADIAN JOURNAL OF MATHEMATICS, 1964, 16 (03): : 539 - &