Critically 3-frustrated signed graphs

DOI10.1016/J.DISC.2024.114258MaRDI QIDQ6635112zbMATH OpenFDO

Authors Chiara Cappello, Reza Naserasr, Eckhard Steffen, Zhouningxin Wang

Publication date 9 November 2024

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2024.114258

zbMATH Keywords

frustration indexsigned graphs

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Frustration-critical signed graphs
• scientific article; zbMATH DE number 1186988
• Maximum frustration in bipartite signed graphs
• Six-flows of signed graphs with frustration index three
• Frustration and isoperimetric inequalities for signed graphs

Cites work

• A modeling and computational study of the frustration index in signed networks
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Cubic graphs on \(\leq 14\) vertices
• Frustration-critical signed graphs
• Multiple weak 2-linkage and its applications on integer flows of signed graphs
• Packing odd circuits in Eulerian graphs
• Signed graphs

This page was built for publication: Critically 3-frustrated signed graphs

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