Separating signatures in signed planar graphs

DOI10.1016/J.DAM.2023.05.015MaRDI QIDQ6110620zbMATH OpenFDO

Authors Reza Naserasr, Weiqiang Yu

Publication date 2 August 2023

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2023.05.015

zbMATH Keywords

packing numberpacking signaturesseparating signaturessigned graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Signed and weighted graphs (05C22) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Every signed planar graph without cycles of length from 4 to 8 is 3-colorable
• Choosability in signed planar graphs
• On the 4-color theorem for signed graphs
• The chromatic number of signed graphs with bounded maximum average degree
• 4-colouring of generalized signed planar graphs

Cites work

• Choosability and edge choosability of planar graphs without five cycles
• Homomorphisms of signed graphs: an update
• On the 4-color theorem for signed graphs
• Planar graphs without cycles of specific lengths
• Signed graph coloring
• Signed graphs
• The chromatic number of a signed graph

Cited in

(5)

• Universally signable graphs
• An algorithmic characterization of splitting signed graph
• scientific article; zbMATH DE number 4137822 (Why is no real title available?)
• Packing Signatures in Signed Graphs
• On the packing number of antibalanced signed simple planar graphs of negative girth at least 5

This page was built for publication: Separating signatures in signed planar graphs

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