Coloring problem of signed interval graphs

DOI10.22108/toc.2019.108880.1541zbMath1474.05170arXiv1612.03280OpenAlexW2971352623MaRDI QIDQ4997206

Farzaneh Ramezani

Publication date: 28 June 2021

Full work available at URL: https://arxiv.org/abs/1612.03280

zbMATH Keywords

signed clique problemsigned coloring problemsigned interval graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22)

Related Items

On the dominated chromatic number of certain graphs

Cites Work

• Unnamed Item
• Some aspects of perfect elimination orderings in chordal graphs
• The chromatic number of a signed graph
• The node-deletion problem for hereditary properties is NP-complete
• Signed graphs
• Signed graph coloring
• Chromatic invariants of signed graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Optimal greedy algorithms for indifference graphs
• The complexity of signed graph and edge-coloured graph homomorphisms
• On the notion of balance of a signed graph
• Extremal interval graphs
• Homomorphisms of Signed Graphs