8 papers
Tighter Bounds on the Degree-Truncated Choice Number of Planar Graphs
Huijuan Xu, Huan Zhou, Jialu Zhu +1
Assume is a graph and is a positive integer. Let be defined as . If is -choosable, then we say is degree-truncated…
Extension of the Gyárfás-Sumner conjecture to signed graphs
Guillaume Aubian, Allen Ibiapina, Luis Kuffner +4
The balanced chromatic number of a signed graph G is the minimum number of balanced sets that cover all vertices of G. Studying structural conditions which imply bounds on the bala…
Brooks' theorem for signed graphs with
Reza Naserasr, Huan Zhou
Circular -coloring of a signed graph is a mapping of its vertices to a circle of circumference such that: I. each pair of vertices with a negative connection is at…
Colouring signed analogues of Kneser, Schrijver, and Borsuk graphs
Luis Kuffner, Reza Naserasr, Lujia Wang +3
The Kneser signed graph $\KS(n,k)$, , is the graph whose vertices are signed -subsets of (i.e. -subsets of such that $S\…
Degree-truncated choosability of graphs
Huan Zhou, Jialu Zhu, Xuding Zhu
A graph is called degree-truncated -choosable if for every list assignment with for each vertex , is -colourable. Richter asked…
Fractional balanced chromatic number and arboricity of planar (signed) graphs
Reza Naserasr, Lan Anh Pham, Cyril Pujol +1
A fractional coloring of a signed graph is an assignment of nonnegative weights to the balanced sets (sets which do not induce a negative cycle) such that each vertex has…