Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
From MaRDI portal
Publication:5518138
DOI10.1007/BF02066678zbMath0142.41404OpenAlexW2016088388MaRDI QIDQ5518138
Publication date: 1961
Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02066678
Related Items
Discussions on orthogonal factorizations in digraphs, Parameterized Complexity of $$(A,\ell )$$-Path Packing, Faster 2-Disjoint-Shortest-Paths Algorithm, Maximum number of disjoint paths connecting specified terminals in a graph, Degree sum conditions for path-factors with specified end vertices in bipartite graphs, Bivariate Complexity Analysis of Almost Forest Deletion, Frames, $A$-Paths, and the Erdös--Pósa Property, A result on \(r\)-orthogonal factorizations in digraphs, Remarks on orthogonal factorizations of digraphs, A polynomial kernel for block graph deletion, The delta-sum of matching delta-matroids, Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel, Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel, Bivariate complexity analysis of \textsc{Almost Forest Deletion}, Coverings and delta-coverings, Finding Maximum Edge-Disjoint Paths Between Multiple Terminals, The Lovász-Cherkassky theorem in countable graphs, Matroid matching and some applications, Subdigraphs with orthogonal factorizations of digraphs, Packing \(A\)-paths of length zero modulo a prime, A randomized polynomial kernel for subset feedback vertex set, Fixed parameterized algorithms for generalized feedback vertex set problems, A generalization of orthogonal factorizations in digraphs, Degree conditions for the existence of vertex-disjoint cycles and paths: a survey, Subdigraphs with orthogonal factorizations of digraphs. II, Indestructive deletions of edges from graphs, A unifying theory of control dependence and its application to arbitrary program structures, Packing cycles with modularity constraints, Packing \(A\)-paths of length zero modulo four, On some connectivity properties of Eulerian graphs, Packing non-zero \(A\)-paths in an undirected model of group labeled graphs, Chordal deletion is fixed-parameter tractable, Graph colourings and partitions, On the ratio of optimal integral and fractional covers, Disjoint non-balanced \(A\)-paths in biased graphs, Unnamed Item, Über die Maximalzahl kantendisjunkter A-Wege, Shortest \((A+B)\)-path packing via hafnian, Packing $A$-Paths in Group-Labelled Graphs via Linear Matroid Parity, Über die Maximalzahl kreuzungsfreier H-Wege, Über ein graphentheoretisches Ergebnis von T. Gallai, Über ein graphentheoretisches Problem von T. Gallai, A generalization of Menger's theorem for certain block-cactus graphs, Pfaffian pairs and parities: counting on linear matroid intersection and parity problems, Packing and Covering Induced Subdivisions, Orthogonal factorizations of digraphs, Disjoint \(A\)-paths in digraphs, $K_4$-Subdivisions Have the Edge-Erdös--Pósa Property, A short proof of Mader's \(\mathcal S\)-paths theorem, Packings and 2-packings of A-paths, Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems, A new proof and generalizations of a theorem of Erdős and Pósa on graphs withoutk+1 independent circuits, Parameterized complexity of \((A,\ell)\)-path packing
Cites Work
