A generalization of simplicial elimination orderings

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199610)23:2<203::AID-JGT11>3.0.CO;2-H" /><203::AID-JGT11>3.0.CO;2-H 10.1002/(SICI)1097-0118(199610)23:2<203::AID-JGT11>3.0.CO;2-HzbMath0871.05020OpenAlexW2022480904MaRDI QIDQ4894623

Frédéric Maffray, Oscar Porto, Myriam Preissmann

Publication date: 25 November 1996

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199610)23:2<203::aid-jgt11>3.0.co;2-h

zbMATH Keywords

algorithmcliquetriangle-free graphsperfectoptimal colouringclique-separable graphbichromatic interchangespretty graphpretty vertexsimplicial elimination orderings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Sequential colorings and perfect graphs

This page was built for publication: A generalization of simplicial elimination orderings