An algorithmic characterization of splitting signed graph

DOI10.1016/j.endm.2017.11.029zbMath1383.05147OpenAlexW2774146924MaRDI QIDQ2413380

Deepa Sinha, Anshu Sethi

Publication date: 10 April 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.11.029

zbMATH Keywords

algorithmsplitting graphsigraphroot splitting sigraphsplitting sigraph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)

Cites Work

• Algorithmic graph theory and perfect graphs
• Characterizations of signed graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An algorithmic characterization of splitting signed graph