On the 4-color theorem for signed graphs. (January 2021)
- Record Type:
- Journal Article
- Title:
- On the 4-color theorem for signed graphs. (January 2021)
- Main Title:
- On the 4-color theorem for signed graphs
- Authors:
- Kardoš, František
Narboni, Jonathan - Abstract:
- Abstract: Máčajová et al. (2016) defined the chromatic number of a signed graph which coincides for all-positive signed graphs with the chromatic number of unsigned graphs. They conjectured that in this setting, for signed planar graphs four colors are always enough, generalizing thereby The Four Color Theorem. We disprove the conjecture.
- Is Part Of:
- European journal of combinatorics. Volume 91(2021)
- Journal:
- European journal of combinatorics
- Issue:
- Volume 91(2021)
- Issue Display:
- Volume 91, Issue 2021 (2021)
- Year:
- 2021
- Volume:
- 91
- Issue:
- 2021
- Issue Sort Value:
- 2021-0091-2021-0000
- Page Start:
- Page End:
- Publication Date:
- 2021-01
- Subjects:
- Combinatorial analysis -- Periodicals
Analyse combinatoire -- Périodiques
Combinatorial analysis
Periodicals
Electronic journals
511.6 - Journal URLs:
- http://www.sciencedirect.com/science/journal/01956698 ↗
http://www.elsevier.com/journals ↗
http://www.idealibrary.com ↗
http://firstsearch.oclc.org ↗
http://firstsearch.oclc.org/journal=0195-6698;screen=info;ECOIP ↗ - DOI:
- 10.1016/j.ejc.2020.103215 ↗
- Languages:
- English
- ISSNs:
- 0195-6698
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - 3829.728200
British Library DSC - BLDSS-3PM
British Library HMNTS - ELD Digital store - Ingest File:
- 23387.xml