4 papers
Colouring negative exact-distance graphs of signed graphs
Reza Naserasr, Patrice Ossona de Mendez, Daniel A. Quiroz +2
The -th exact-distance graph, of a graph has as its vertex set, and as an edge if and only if the distance between and is (exactly) in . We consid…
Bounding signed bipartite partial t-trees and application to edge-coloring
Meirun Chen, Reza Naserasr
Given a signed bipartite graph of negative girth , we present a necessary and sufficient condition for it to have the following property: each signed bipartite graph…
Odd Hadwiger's conjecture for the complements of Kneser graphs
Meirun Chen, Reza Naserasr, Lujia Wang +1
A generalization of the four-color theorem, Hadwiger's conjecture is considered as one of the most important and challenging problems in graph theory, and odd Hadwiger's conjecture…
Signed projective cubes, a homomorphism point of view
Meirun Chen, Reza Naserasr, Alessandra Sarti
The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. D…