Items where Subject is "05-XX Combinatorics > 05Cxx Graph theory > 05C20 Directed graphs (digraphs), tournaments"
![]() | Up a level |
- MSC Classification Numbers (14)
- 05-XX Combinatorics (14)
- 05Cxx Graph theory (14)
- 05C20 Directed graphs (digraphs), tournaments (14)
- 05Cxx Graph theory (14)
- 05-XX Combinatorics (14)
A
Andres, Dominique
(2009)
Lightness of digraphs in surfaces and directed game chromatic number.
Published in:
Discrete Mathematics Vol. 309 (11).
pp. 3564-3579.
Andres, Dominique (2003) Spieltheoretische Kantenfärbungsprobleme auf Wäldern und verwandte Strukturen. Masters thesis.
B
Buchheim, Christoph and Jünger, Michael and Kandyba, Maria and Percan, Merijam and Schulz, Michael
(2007)
Planarization With Fixed Subgraph Embedding.
Technical Report
, 10 p.
Buchheim, Christoph and Jünger, Michael and Menze, Annette and Percan, Merijam
(2006)
Bimodal Crossing Minimization.
Published In:
Computing and combinatorics : 12th annual international conference, COCOON 2006, Taipei, Taiwan, August 15 - 18, 2006 ; proceedings, Lecture Notes in Computer Science. 4112 Springer 2006, pp. 497-506.
Buchheim, Christoph and Jünger, Michael and Percan, Merijam and Schulz, Michael and Thelen, Christina
(2007)
Drawing cycles in networks.
Technical Report
, 8 p.
F
Faigle, Ulrich and Schrader, Rainer
(1990)
Graphs and Orders.
Published in:
Computing Supplementum Vol. 7.
pp. 109-124.
G
Grötschel, Martin and Jünger, Michael and Reinelt, Gerhard
(1985)
Acyclic Subdigraphs and Linear Orderings: Polytopes, Facets, and a cutting Plane Algorithm.
Published in:
Graphs and Order : the Role of graphs in the Theory of Ordered Sets and its Aplications., NATO ASI series : Series C, Mathematical and physical sciences ; 147. D. Reidel Publishing Company 1985, pp. 218-264.
Grötschel, Martin and Jünger, Michael and Reinelt, Gerhard
(1985)
Facets of the Linear Ordering Polytope.
Published in:
Mathematical Programming Vol. 33 (1).
pp. 43-60.
ISSN 0025-5610
Grötschel, Martin and Jünger, Michael and Reinelt, Gerhard
(1985)
On the acyclic Subgraph Polytope.
Published in:
Mathematical Programming Vol. 33 (1).
pp. 28-42.
ISSN 0025-5610
K
Korte, Bernhard and Schrader, Rainer
(1981)
A survey on oracle techniques.
Published In:
Mathematical Foundations of Computer Science ; Proceedings, 10th Symposium Štrbské Pleso, Czechoslovakia August 31 – September 4, 1981, Lecture Notes in Computer Science. 118 Springer 1981, pp. 61-77.
L
Lätsch, Martin (2008) Schranken für den minimalen orientierten Durchmesser. PhD thesis.
Lätsch, Martin and Peis, Britta
(2008)
On a relation between the domination number and a strongly connected bidirection of an undirected graph.
Published in:
Discrete Applied Mathematics Vol. 156 (17).
pp. 3194-3202.
M
Mallach, Sven
(2015)
A practical mixed-integer programming model for
the vertex separation number problem.
Working Paper
, 8 p.
S
Schwikowski, B. and Speckenmeyer, Ewald
(1997)
On computing all minimal solutions for feedback problems.
Technical Report
, 10 p.