Delay Colouring in Quartic Graphs
Copyright policy ) Katherine Edwards; W. Sean Kennedy;
Delay Colouring in Quartic Graphs
Haxell, Wilfong, and Winkler conjectured that every bipartite graph with maximum degree $\Delta$ is $(\Delta + 1)$-delay-colourable. We prove this conjecture in the special case $\Delta = 4$.
Coloring of graphs and hypergraphs
Coloring of graphs and hypergraphs
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
selected citations
Citations provided by BIP!
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
Citations provided by BIP!popularityPopularity provided by BIP!
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
Popularity provided by BIP! 0
Average
Average
Average
gold
Fields of Science