Indexed metadata
Perfectly orderable graphs and almost all perfect graphs are kernelM-solvable
Mostafa Blidia, Konrad Engel
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.