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

DOI10.1007/S10878-023-01103-9MaRDI QIDQ6123389zbMATH OpenOpenAlexFDO

Authors Reza Naserasr, Weiqiang Yu

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

packing numberplanar graphssigned graph

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Recommendations

• Packing Signatures in Signed Graphs
• Separating signatures in signed planar graphs
• On the 4-color theorem for signed graphs
• Extended double covers and homomorphism bounds of signed graphs

Cites work

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

Cited in

(1)

• 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

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