Coloring signed graphs using DFS

DOI10.1007/S11590-015-0962-8zbMath1336.05055OpenAlexW1892274687MaRDI QIDQ276341

F. Blanchet-Sadri, M. Dambrine

Publication date: 3 May 2016

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: http://real.mtak.hu/28096/1/sbrheadernelk.pdf

zbMATH Keywords

chromatic numbersigned graphDFSgreedy coloring

Mathematics Subject Classification ID

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

Related Items (5)

Variable degeneracy on toroidal graphs ⋮ Homomorphisms of signed graphs: an update ⋮ Concepts of signed graph coloring ⋮ Cover and variable degeneracy ⋮ Edge coloring of the signed generalized Petersen graph

Cites Work

• The chromatic number of a signed graph
• Signed graphs
• Signed graph coloring
• On the notion of balance of a signed graph
• Unnamed Item

This page was built for publication: Coloring signed graphs using DFS