Coloring signed graphs using DFS

DOI10.1007/S11590-015-0962-8zbMATH Open1336.05055OpenAlexW1892274687MaRDI QIDQ276341FDOQ276341

Tamás Fleiner, Gábor Wiener

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

Recommendations

• Edge coloring signed graphs
• Degree choosable signed graphs
• The chromatic number of a signed graph
• How colorful the signed graph?
• scientific article; zbMATH DE number 7614204

zbMATH Keywords

chromatic numbersigned graphDFSgreedy coloring

Mathematics Subject Classification ID

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

Cites Work

• Signed graphs
• Signed graph coloring
• On the notion of balance of a signed graph
• Title not available (Why is that?)
• The chromatic number of a signed graph

Cited In (5)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q276341)