The 1-Factors of Oriented Graphs
From MaRDI portal
Publication:5824083
DOI10.2307/2031831zbMath0052.20004OpenAlexW4231081460MaRDI QIDQ5824083
Publication date: 1953
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2031831
Related Items
On graphs with equal domination and covering numbers, Discussions on orthogonal factorizations in digraphs, Proof of a theorem of Tutte using permanents, Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday), Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles, Component factors and binding number conditions in graphs, The territorial raider game and graph derangements, A note on semi-coloring of graphs, Fractional matchings, component-factors and edge-chromatic critical graphs, A result on \(r\)-orthogonal factorizations in digraphs, Corrigendum to: ``Existence of a perfect matching in a random \((1+e^{-1})\)-out bipartite graph, On the determinant of bipartite graphs, Characterization of 1-tough graphs using factors, Remarks on component factors, Strong Tutte type conditions and factors of graphs, Subgraphs and their degree sequences of a digraph, The factorization of graphs. II, How many matchings cover the nodes of a graph?, Subdigraphs with orthogonal factorizations of digraphs, Star-factors with large components, Maximum-Minimum Sätze über Graphen, A generalization of orthogonal factorizations in digraphs, On perfect \(k\)-matchings, Subdigraphs with orthogonal factorizations of digraphs. II, Star-cycle factors of graphs, On unique \(k\)-factors and unique \([1,k\)-factors in graphs.], 2-Matchings and 2-covers of hypergraphs, Marriage in denumerable societies, Well-covered graphs and factors, Fractional factors, component factors and isolated vertex conditions in graphs, Aneulerian digraphs and the determination of those Eulerian digraphs having an odd number of directed Eulerian paths, Matchings and covers in hypergraphs, Simplified existence theorems for \((g,f)\)-factors, Matchings with few colors in colored complete graphs and hypergraphs, Induced star-triangle factors of graphs, Graphs and Subgraphs, On 1-sum flows in undirected graphs, Orthogonal factorizations of digraphs, Characterizations of graphs \(G\) having all \([1, k\)-factors in \(k G\)], Characterization of graphs with equal domination and covering number, Ear-decompositions of matching-covered graphs, Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen, Characterizing star factors via the size, the spectral radius or the distance spectral radius of graphs, Star-like factors with large components
