Minmax relations for cyclically ordered digraphs (Q885290): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.jctb.2006.09.005 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2144825483 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4190428 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: k-optimal partitions of a directed graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Coflow polyhedra / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Cyclic orders: equivalence and duality / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4149476 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Anti-blocking polyhedra / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The structure of Sperner k-families / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Extending the Greene-Kleitman theorem to directed graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3330973 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Circular chromatic number: A survey / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 19:55, 25 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Minmax relations for cyclically ordered digraphs |
scientific article |
Statements
Minmax relations for cyclically ordered digraphs (English)
0 references
8 June 2007
0 references
stable set
0 references
coloring
0 references
orders
0 references
covering
0 references
packing
0 references
polyhedron
0 references
network flow
0 references
minimum cost flow
0 references