On the packing number of antibalanced signed simple planar graphs of negative girth at least 5

DOI10.1007/S10878-023-01103-9OpenAlexW4390836114MaRDI QIDQ6123389

Weiqiang Yu, Reza Naserasr

Publication date: 4 March 2024

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-023-01103-9

zbMATH Keywords

planar graphspacking numbersigned graph

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Unnamed Item
• Homomorphisms of triangle-free graphs without a \(K_{5}\)-minor
• Signed graphs
• Four problems on graphs with excluded minors
• On the 4-color theorem for signed graphs
• The complexity of signed graph and edge-coloured graph homomorphisms
• (2 + ?)-Coloring of planar graphs with large odd-girth
• Packing Signatures in Signed Graphs

This page was built for publication: On the packing number of antibalanced signed simple planar graphs of negative girth at least 5