Subdivisions with congruence constraints in digraphs of large chromatic number
type: Item
instance of: scholarly article
title: Subdivisions with congruence constraints in digraphs of large chromatic number
zbMATH Open document ID: 1529.05074
arXiv ID: 2208.06358
published in: Journal of Graph Theory
publication date: 2024-01-04T00:00:00Z
full work available at URL: https://arxiv.org/abs/2208.06358
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C12
zbMATH DE Number: 7783198
zbMATH Keywords: dichromatic number
zbMATH Keywords: parity constraint
zbMATH Keywords: subdivision
zbMATH Keywords: totally odd subdivision
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W4385636833
cites work: Subdivisions in digraphs of large out-degree or large dichromatic number
cites work: Divisible subdivisions
cites work: Cycles Modulo k
cites work: Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
cites work: Hajos' graph-coloring conjecture: Variations and counterexamples
cites work: Coloring digraphs with forbidden cycles
cites work: Q3882513
cites work: On the conjecture of Hajos
cites work: Subdivisions of digraphs in tournaments
cites work: Dichromatic number and forced subdivisions
cites work: Totally odd subdivisions and parity subdivisions: Structures and Coloring
cites work: Topological cliques in graphs II
cites work: Homomorphieeigenschaften und mittlere Kantendichte von Graphen
cites work: The dichromatic number of a digraph
cites work: Graph decomposition with applications to subdivisions and path systems modulo k
cites work: Totally odd \(K_4\)-subdivisions in 4-chromatic graphs
cites work: Proof of Toft's conjecture: Every graph containing no fully odd \(K_4\) is 3-colorable
DOI: 10.1002/JGT.23020
description: scientific article; zbMATH DE number 7783198