1 citations · 1 across the 9 of their papers we have counts for
5 papers · 1 filter
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 d…
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…
Indicated list colouring game on graphs
Yangyan Gu, Yiting Jiang, Huan Zhou +2
Given a graph and a list assignment for , the indicated -colouring game on is played by two players: Ann and Ben. In each round, Ann chooses an uncoloured vertex…