Skip to Main content Skip to Navigation
Reports

On the signed chromatic number of some classes of graphs

Abstract : A signed graph $(G, \sigma)$ is a graph $G$ along with a function $\sigma: E(G) \to \{+,-\}$. A closed walk of a signed graph is positive (resp., negative) if it has an even (resp., odd) number of negative edges, counting repetitions. A homomorphism of a (simple) signed graph to another signed graph is a vertex-mapping that preserves adjacencies and signs of closed walks. The signed chromatic number of a signed graph $(G, \sigma)$ is the minimum number of vertices $|V(H)|$ of a signed graph $(H, \pi)$ to which $(G, \sigma)$ admits a homomorphism. Homomorphisms of signed graphs have been attracting growing attention in the last decades, especially due to their strong connections to the theories of graph coloring and graph minors. These homomorphisms have been particularly studied through the scope of the signed chromatic number. In this work, we provide new results and bounds on the signed chromatic number of several families of signed graphs (planar graphs, triangle-free planar graphs, $K_n$-minor-free graphs, and bounded-degree graphs).
Document type :
Reports
Complete list of metadata

Cited literature [28 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02947399
Contributor : Julien Bensmail <>
Submitted on : Thursday, September 24, 2020 - 8:03:33 AM
Last modification on : Tuesday, June 1, 2021 - 2:08:09 PM
Long-term archiving on: : Thursday, December 3, 2020 - 4:27:21 PM

Files

main.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02947399, version 1
  • ARXIV : 2009.12059

Citation

Julien Bensmail, Sandip Das, Soumen Nandi, Théo Pierron, Sagnik Sen, et al.. On the signed chromatic number of some classes of graphs. [Research Report] Université Côte D'Azur; Université de Bordeaux; Université Lyon 1. 2020. ⟨hal-02947399⟩

Share

Metrics

Record views

82

Files downloads

111