/***
##############################
# Identification of the news #
##############################
# DO NOT MODIFY
name: eurocomb-21-naserasr-wang
date: 2021-09-03


################
# General data #
################

# the picture address, in dokuwiki or web syntax
picture = :actualites:ressources:signed_bipartite_planar_graph.png

# the name displayed when hovering over the picture (optional)
picture tag = Accepted paper Eurocomb 2021 - Naserasr-Wang

# the link to be followed when clicking on the picture (optional)
picture link = https://www.irif.fr/~reza/pdfs/papers/EUROCOMB%202021_Circular%20coloring%20of%20signed%20bipartite%20planar%20graphs_final.pdf

# the link in the circled arrow icon (optional)
extra link = https://www.irif.fr/~reza/pdfs/papers/EUROCOMB%202021_Circular%20coloring%20of%20signed%20bipartite%20planar%20graphs_final.pdf


#######################
# Visibility/priority #
#######################
#
# This part describes when the news should be visible, and with what priority (how high in the list).
#

from 2021-09-03 for 2 month, priority= low
from 2021-09-03 for 2 weeks, priority= normal
from 2021-09-03 for 1 week, priority= high

before 2021-09-03, visible= false

#
# Other intervals of priority can/have to be specified.
#
# As a rule of thumb:
#  - priority high for up to 3 days, 10 days for very important events (FOCS) (appears top of the list)
#  - priority normal for up to 2 or 3 weeks (appears with high probability)
#  - priority low for as long as one wishes (probably invisible but sometimes can be if there is sufficient space)
#  - priority null makes the news invisible
#  - priorities may change several times (e.g. high for registration and for the event)
#  - this syntax can also be used for changing pictures, links, ...
#
# The syntax is the following
#   from DATE until DATE, priority= PRIORITY
#   from DATE for DURATION, priority= PRIORITY
#   for DURATION until DATE, priority= PRIORITY
#
# PRIORITY: high | normal | low | null
#
# DATE:
#   NUMBER MONTH NUMBER   (e.g. 22 June 2018)
#   ???-??-??             (e.g. 2018-06-22)
#
# DURATION:
#   NUMBER (day|days|week|weeks|month|months|year|years)


##########
# Notion #
##########
# if one wants to have a notion (a small text that unravels when clicked and is used to highlight a concept)
#
# notion = NOTION NAME
# notion text = {TEXT OF THE NOTION}


####################
# TEXT OF THE NEWS #
####################
***/
[[https://www.irif.fr/~reza/pmwiki/pmwiki.php|Reza Naserasr]] and [[https://www.irif.fr/~wangzhou4/|Zhouningxin Wang]] (IRIF) will present the notion of **circular coloring of signed graphs**, as a common extension of the circular coloring of graphs and the 0-free coloring of signed graphs. In this work, they consider the problem of finding the best upper bound of the circular chromatic number of restricted families of signed graphs. In particular, they show that every signed bipartite planar graph of negative-girth 6 admits a circular 3-coloring.