Work

Strong odd coloring in minor-closed classes

Year: 2025

Type: preprint

Abstract: We show that the strong odd chromatic number on any proper minor-closed graph class is bounded by a constant. We almost determine the smallest such constant for outerplanar graphs.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2505.02736

Authors: Goetze, Miriam, Klute, Fabian, Knauer, Kolja, Parada, Irene, Peña, Juan Pablo, Ueckerdt, Torsten

Institutions: Karlsruhe Institute of Technology, Universitat Politècnica de Catalunya, Universitat de Barcelona, Center for Mathematical Modeling, University of Chile

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: European Commission, Deutsche Forschungsgemeinschaft, Ministerio de Asuntos Económicos y Transformación Digital, Gobierno de España, Agencia Nacional de Investigación y Desarrollo, Agencia Estatal de Investigación, Ministerio de Universidades, NextGenerationEU

Awards: G14461421, G2262748287, G3480869486, G3681454997, G4042783231, G425668148, Überdeckungszahlen in Theorie und Praxis, G6468150428, G6989706184, G7084143925, CENTER FOR MATHEMATICAL MODELING (CMM), G84477964

OpenAlex ID: W4415032449

Cites:

Cited by:

Related to: