Sink-Stable Sets of Digraphs

DOI10.1137/110849390zbMath1309.05070arXiv1205.6071OpenAlexW1972919209MaRDI QIDQ5246079

Krisztián Kun, András Frank, Dóra Erdős

Publication date: 17 April 2015

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1205.6071

zbMATH Keywords

digraphsstable setsclar numbercolorationsmin-max formulae

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial optimization (90C27) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items

The complexity of the Clar number problem and an exact algorithm