The size of minimum 3-trees: Cases 3 and 4 mod 6

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199903)30:3<157::AID-JGT1>3.0.CO;2-S" /><157::AID-JGT1>3.0.CO;2-S 10.1002/(SICI)1097-0118(199903)30:3<157::AID-JGT1>3.0.CO;2-SzbMath0917.05053OpenAlexW4243676847MaRDI QIDQ4237725

Joaquín Tey, Jorge Luis Arocha

Publication date: 29 June 1999

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199903)30:3<157::aid-jgt1>3.0.co;2-s

zbMATH Keywords

hypergraph coloringstriangulation of surfacestight hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: The size of minimum 3-trees: Cases 3 and 4 mod 6