Results 181 to 190 of about 1,222,002 (199)

A Generalization of the Perfect Graph Theorem Under the Disjunctive Index

Mathematics of Operations Research, 2002
In this paper, we relate antiblocker duality between polyhedra, graph theory, and the disjunctive procedure. In particular, we analyze the behavior of the disjunctive procedure over the clique relaxation, 𝒦(G), of the stable set polytope in a graph G, and the one associated to its complementary graph, 𝒦(Ḡ).
Graciela Nasini
exaly   +3 more sources

Tutte type theorems for graphs having a perfect internal matching

Information Processing Letters, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Miklós Krész
exaly   +4 more sources

Simple Proofs of the Strong Perfect Graph Theorem Using Polyhedral Approaches and Proving P=NP as a Conclusion

2020 International Conference on Computational Science and Computational Intelligence (CSCI), 2020
The strong perfect graph theorem is the proof of the famous Berge’s conjecture that the graph is perfect if and only if it is free of odd holes and odd anti-holes. The conjecture was settled after 40 years in 2002 by Maria Chudnovsky et. al. and the proof was published in 2006.
exaly   +2 more sources

On the Perfect Graph Theorem

Mathematical Programming, 1973
exaly   +2 more sources

The Strong Perfect Graph Theorem for a Class of Partitionable Graphs

1984
A simple adjacency criterion is presented which, when satisfied, implies that a minimal imperfect graph is an odd hole or an odd antihole. For certain classes of graphs, including K 1,3 -free graphs, it is straightforward to validate this criterion and thus establish the Strong Perfect Graph Theorem for such graphs.
Rick Giles, L.E. Trotter, Alan Tucker
openaire   +1 more source

A Combinatorial Theorem on Ordered Circular Sequences of n 1 u's and n 2 v' s with Application to Kernel-perfect Graphs

Acta Mathematicae Applicatae Sinica, English Series, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guo, Xiao-feng, Huang, Yi
openaire   +2 more sources

A semi-strong perfect graph theorem /

1986
This item was digitized as part of a project to share McGill's intellectual legacy with the public. If you are the copyright holder or a relative of the copyright holder who is deceased, you may request withdrawal by emailing escholarship.library@mcgill.ca.
openaire   +1 more source

On chromatic number and perfectness of fuzzy graph

Information Sciences, 2022
Madhumangal Pal, Sreenanda Raut
exaly  

An extension of the Erdős-Ko-Rado theorem to set-wise 2-intersecting families of perfect matchings

Discrete Mathematics, 2023
Mahsa N. Shirazi
exaly