question on Graph Theory

O

oke

New member
Joined
Aug 2, 2022
Messages
3
Hi, can someone please help me to answer to the following question on Graph Theory:
Is there a polynomial time algorithm to recognize a 1-perfect graph?
(a graph G is 1-perfect graph if and only if
{\displaystyle \chi (G)=\omega (G)}
)
 
oke said:
Hi, can someone please help me to answer to the following question on Graph Theory:
Is there a polynomial time algorithm to recognize a 1-perfect graph?
(a graph G is 1-perfect graph if and only if
{\displaystyle \chi (G)=\omega (G)}
)
Click to expand...
Please show us what you have tried and exactly where you are stuck.

Please follow the rules of posting in this forum, as enunciated at:


Please share your work/thoughts about this problem
 
You must log in or register to reply here.
Top