Graphs and Subgraphs
From MaRDI portal
Publication:3241661
DOI10.2307/1992894zbMath0077.17001OpenAlexW4254106274MaRDI QIDQ3241661
No author found.
Publication date: 1957
Full work available at URL: https://doi.org/10.2307/1992894
Related Items (18)
Maximal-\(\Gamma\)-prime Graphen ⋮ Unnamed Item ⋮ Ryser's theorem for \(\rho\)-Latin rectangles ⋮ Extensions to 2-factors in bipartite graphs ⋮ Proper orientations and proper chromatic number ⋮ Some sufficient conditions for a graph with minimum degree to be \(k\)-factor-critical ⋮ On some factor theorems of graphs ⋮ Generalizations of marriage theorem for degree factors ⋮ Tough graphs and Hamiltonian circuits. (Reprint) ⋮ The circular law for random regular digraphs ⋮ On the zero-sum group-magicness of Cartesian products ⋮ Fractional matching preclusion number of graphs and the perfect matching polytope ⋮ Faktorklassen in Graphen ⋮ Tough graphs and Hamiltonian circuits. ⋮ Connected \(k\)-factors in bipartite graphs ⋮ The Edmonds-Gallai decomposition for matchings in locally finite graphs ⋮ Regular factors in nearly regular graphs ⋮ Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
Cites Work
- Graphs and matching theorems
- Studies on directed graphs. I, II
- Ein Kriterium für das Vorhandensein von Faktoren in beliebigen Graphen
- The Factorization of Linear Graphs
- The Factorization of Locally Finite Graphs
- On factorisation of graphs
- Reguläre Faktoren von Graphen.
- The Factors of Graphs
- The 1-Factors of Oriented Graphs
- A Short Proof of the Factor Theorem for Finite Graphs
This page was built for publication: Graphs and Subgraphs