1-Faktoren von Graphen. (1-factors of graphs)

DOI10.1007/BF01428195zbMath0234.05115WikidataQ56626056 ScholiaQ56626056MaRDI QIDQ2551474

W. Mader

Publication date: 1973

Published in: Mathematische Annalen (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/162392

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Related Items (22)

Alternating cycles and paths in edge-coloured multigraphs: A survey ⋮ On Vertex-Edge-Critically n-Connected Graphs ⋮ Fractional Gallai-Edmonds decomposition and maximal graphs on fractional matching number ⋮ A note on the minimum size of matching-saturated graphs ⋮ f-factors and related decompositions of graphs ⋮ Ramsey-minimal saturation numbers for matchings ⋮ On unique \(k\)-factors and unique \([1,k\)-factors in graphs.] ⋮ Anticritical graphs ⋮ On saturation games ⋮ Matching theory -- a sampler: From Dénes König to the present ⋮ The game of \(\mathcal F\)-saturator ⋮ The binding number of a graph and its Anderson number ⋮ Endlichkeitssätze für k-kritische Graphen ⋮ Equipartite colorings in graphs and hypergraphs ⋮ Über ein graphentheoretisches Ergebnis von T. Gallai ⋮ Unnamed Item ⋮ The number of 1-factors in 2k-connected graphs ⋮ An extension of Tutte's 1-factor theorem ⋮ Counting 1-factors in infinite graphs ⋮ On the number of 1-factors of locally finite graphs ⋮ The Edmonds-Gallai decomposition for matchings in locally finite graphs ⋮ Minimum \(t P_3\)-saturation graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Transversal theory. An account of some aspects of combinatorial mathematics
• Perfect matchings of a graph
• On the 1-factors of a non-separable graph
• A theorem on n-connected graphs
• The Factorization of Linear Graphs

This page was built for publication: 1-Faktoren von Graphen. (1-factors of graphs)