An orientation theorem for graphs
From MaRDI portal
Publication:1338310
DOI10.1006/jctb.1994.1064zbMath0807.05020OpenAlexW2042934764MaRDI QIDQ1338310
Publication date: 2 March 1995
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/2237
Combinatorial aspects of matroids and geometric lattices (05B35) Structural characterization of families of graphs (05C75)
Related Items (6)
The representation polyhedron of a semiorder. ⋮ A min-max relation for stable sets in graphs with no odd-\(K_ 4\) ⋮ Odd-\(K_{4}\)'s in stability critical graphs ⋮ Coloring graphs with no \(\text{odd-}K_4\) ⋮ Strong orientations without even directed circuits ⋮ Interpolation theorem for a continuous function on orientations of a simple graph
This page was built for publication: An orientation theorem for graphs
