Pages that link to "Item:Q5518138"
From MaRDI portal
The following pages link to Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen (Q5518138):
Displayed 50 items.
- Subdigraphs with orthogonal factorizations of digraphs (Q427789) (← links)
- A unifying theory of control dependence and its application to arbitrary program structures (Q650921) (← links)
- Packing cycles with modularity constraints (Q653988) (← links)
- Shortest \((A+B)\)-path packing via hafnian (Q724248) (← links)
- Packing non-zero \(A\)-paths in an undirected model of group labeled graphs (Q965242) (← links)
- Chordal deletion is fixed-parameter tractable (Q973007) (← links)
- Orthogonal factorizations of digraphs (Q1042545) (← links)
- Matroid matching and some applications (Q1144584) (← links)
- Indestructive deletions of edges from graphs (Q1164646) (← links)
- On the ratio of optimal integral and fractional covers (Q1224109) (← links)
- Über die Maximalzahl kantendisjunkter A-Wege (Q1236549) (← links)
- Über die Maximalzahl kreuzungsfreier H-Wege (Q1246433) (← links)
- Über ein graphentheoretisches Problem von T. Gallai (Q1257027) (← links)
- Maximum number of disjoint paths connecting specified terminals in a graph (Q1339394) (← links)
- The delta-sum of matching delta-matroids (Q1381847) (← links)
- Bivariate complexity analysis of \textsc{Almost Forest Deletion} (Q1686068) (← links)
- A randomized polynomial kernel for subset feedback vertex set (Q1702849) (← links)
- A generalization of orthogonal factorizations in digraphs (Q1705655) (← links)
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey (Q1706420) (← links)
- A generalization of Menger's theorem for certain block-cactus graphs (Q1805372) (← links)
- A short proof of Mader's \(\mathcal S\)-paths theorem (Q1850551) (← links)
- Disjoint non-balanced \(A\)-paths in biased graphs (Q2020032) (← links)
- Pfaffian pairs and parities: counting on linear matroid intersection and parity problems (Q2061881) (← links)
- Parameterized complexity of \((A,\ell)\)-path packing (Q2118381) (← links)
- Discussions on orthogonal factorizations in digraphs (Q2125658) (← links)
- Packing \(A\)-paths of length zero modulo four (Q2237857) (← links)
- Degree sum conditions for path-factors with specified end vertices in bipartite graphs (Q2374163) (← links)
- A result on \(r\)-orthogonal factorizations in digraphs (Q2400968) (← links)
- A polynomial kernel for block graph deletion (Q2408204) (← links)
- Subdigraphs with orthogonal factorizations of digraphs. II (Q2441627) (← links)
- Disjoint \(A\)-paths in digraphs (Q2565693) (← links)
- The Lovász-Cherkassky theorem in countable graphs (Q2680564) (← links)
- Packing \(A\)-paths of length zero modulo a prime (Q2692782) (← links)
- Fixed parameterized algorithms for generalized feedback vertex set problems (Q2693637) (← links)
- Packing $A$-Paths in Group-Labelled Graphs via Linear Matroid Parity (Q2797090) (← links)
- Remarks on orthogonal factorizations of digraphs (Q2931951) (← links)
- Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel (Q2946421) (← links)
- Bivariate Complexity Analysis of Almost Forest Deletion (Q3196379) (← links)
- Packings and 2-packings of A-paths (Q3439371) (← links)
- On some connectivity properties of Eulerian graphs (Q4103563) (← links)
- Über ein graphentheoretisches Ergebnis von T. Gallai (Q4172084) (← links)
- Frames, $A$-Paths, and the Erdös--Pósa Property (Q4564886) (← links)
- Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel (Q4637327) (← links)
- Packing and Covering Induced Subdivisions (Q4986803) (← links)
- Parameterized Complexity of $$(A,\ell )$$-Path Packing (Q5041178) (← links)
- Faster 2-Disjoint-Shortest-Paths Algorithm (Q5042231) (← links)
- (Q5091009) (← links)
- Coverings and delta-coverings (Q5101418) (← links)
- A new proof and generalizations of a theorem of Erdős and Pósa on graphs withoutk+1 independent circuits (Q5538409) (← links)
- $K_4$-Subdivisions Have the Edge-Erdös--Pósa Property (Q5857001) (← links)