Cited in
(19)- Supermodularity in unweighted graph optimization. III: Highly connected digraphs
- A formulation of the wide partition conjecture using the atom problem in discrete tomography
- A sufficient condition for the existence of an anti-directed 2-factor in a directed graph
- New linearizations of quadratic assignment problems
- Proper orientations and proper chromatic number
- Bartholdi zeta and \(L\)-functions of weighted digraphs, their coverings and products
- Über reguläre Kettengruppen
- Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem
- A Very General Theorem on Systems of Distinct Representatives
- On graphs with equal edge connectivity and minimum degree
- Graph factors
- Supermodularity in unweighted graph optimization. II: Matroidal term rank augmentation
- On the degrees of the vertices of a directed graph
- Graphs and Subgraphs
- Parameters and fractional factors in different settings
- Generalizations of marriage theorem for degree factors
- Maximum-Minimum Sätze über Graphen
- Supermodularity in unweighted graph optimization. I: Branchings and matchings
- On interval and cyclic interval edge colorings of \((3, 5)\)-biregular graphs
This page was built for publication: Studies on directed graphs. I, II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q768185)
