Critical digraphs with few vertices
Year: 2019
Type: preprint
Abstract: We show that every k-dichromatic vertex-critical digraph on at most 2k-2 vertices has a disconnected complement. This answers a question of Bang-Jensen et al., and generalises a classical theorem of Gallai on undirected vertex-critical graphs.
Source: arXiv (Cornell University)
Author: Stehlík, Matěj
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2977838535