The hardness of intervalizing four colored caterpillars
From MaRDI portal
Publication:5937916
DOI10.1016/S0012-365X(00)00257-0zbMath0977.05055WikidataQ126819312 ScholiaQ126819312MaRDI QIDQ5937916
Maria J. Serna, Carme Àlvarez, Josep Diaz
Publication date: 18 July 2001
Published in: Discrete Mathematics (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Protein sequences, DNA sequences (92D20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Improved Lower Bounds for Graph Embedding Problems ⋮ Bipartite completion of colored graphs avoiding chordless cycles of given lengths ⋮ Some completion problems for graphs without chordless cycles of prescribed lengths ⋮ Completing colored graphs to meet a target property ⋮ The b-chromatic number of power graphs of complete caterpillars ⋮ On the proper intervalization of colored caterpillar trees ⋮ The Proper Interval Colored Graph problem for caterpillar trees ⋮ Exact algorithms for intervalizing coloured graphs