5 citations · 5 across the 2 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2019★ 5 cited
A Constructive Formalization of the Weak Perfect Graph Theorem
Abhishek Kr Singh, Raja Natarajan
The Perfect Graph Theorems are important results in graph theory describing the relationship between clique number and chromatic number of a graph . A graph …
cs.LO2018
Towards a constructive formalization of Perfect Graph Theorems
Abhishek Kr Singh, Raja Natarajan
Interaction between clique number and chromatic number of a graph is a well studied topic in graph theory. Perfect Graph Theorems are probably the most important re…