REVIEW 2 cited by
Colourings of $(m, n)$-coloured mixed graphs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
abstract
A mixed graph is, informally, an object obtained from a simple undirected graph by choosing an orientation for a subset of its edges. A mixed graph is $(m, n)$-coloured if each edge is assigned one of $m \geq 0$ colours, and each arc is assigned one of $n \geq 0$ colours. Oriented graphs are $(0, 1)$-coloured mixed graphs, and 2-edge-coloured graphs are $(2, 0)$-coloured mixed graphs. We show that results of Sopena for vertex colourings of oriented graphs, and of Kostochka, Sopena and Zhu for vertex colourings oriented graphs and 2-edge-coloured graphs, are special cases of results about vertex colourings of $(m, n)$-coloured mixed graphs. Both of these can be regarded as a version of Brooks' Theorem.
Forward citations
Cited by 2 Pith papers
-
Toward a Dynamical Taxonomy of Insomnia: A Multiaxial Framework for Sleep-State Transitions and Architectural Failure
A multiaxial dynamical taxonomy for insomnia, using a Landau-Ginzburg phenomenological model, organizes failure by operation, stage, and causal status and makes two falsifiable predictions.
-
Wavelet Scattering Transform for Interpretable Schizophrenia Biomarker Discovery and Classification from Resting-State EEG
A single sentence stating the discovery directly. ≤ 300 chars.
Discussion (0). Continue with ORCID to comment.