A simple linear time algorithm for triangulating three-colored graphs

DOI10.1007/3-540-55210-3_201zbMath1494.68190OpenAlexW1587012825MaRDI QIDQ5096799

Ton Kloks, Hans L. Bodlaender

Publication date: 18 August 2022

Published in: STACS 92 (Search for Journal in Brave)

Full work available at URL: https://dspace.library.uu.nl/handle/1874/17939

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

On the Block Number of Graphs

Cites Work

• On rigid circuit graphs
• Incidence matrices and interval graphs
• Algorithms finding tree-decompositions of graphs
• Steiner trees, partial 2–trees, and minimum IFI networks
• Inferring Evolutionary History From DNA Sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item