Pages that link to "Item:Q2551474"

The following pages link to 1-Faktoren von Graphen. (1-factors of graphs) (Q2551474):

Displaying 23 items.

• On saturation games (Q499485) (← links)
• The game of \(\mathcal F\)-saturator (Q968127) (← links)
• The Edmonds-Gallai decomposition for matchings in locally finite graphs (Q1053712) (← links)
• f-factors and related decompositions of graphs (Q1147717) (← links)
• Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
• Endlichkeitssätze für k-kritische Graphen (Q1229889) (← links)
• Equipartite colorings in graphs and hypergraphs (Q1236124) (← links)
• The number of 1-factors in 2k-connected graphs (Q1253256) (← links)
• An extension of Tutte's 1-factor theorem (Q1256496) (← links)
• Alternating cycles and paths in edge-coloured multigraphs: A survey (Q1356728) (← links)
• On unique \(k\)-factors and unique \([1,k]\)-factors in graphs. (Q1427474) (← links)
• Counting 1-factors in infinite graphs (Q1814587) (← links)
• On the number of 1-factors of locally finite graphs (Q1839264) (← links)
• Minimum \(t P_3\)-saturation graphs (Q2112662) (← links)
• Fractional Gallai-Edmonds decomposition and maximal graphs on fractional matching number (Q2185816) (← links)
• Ramsey-minimal saturation numbers for matchings (Q2436829) (← links)
• (Q3728935) (← links)
• Anticritical graphs (Q4081291) (← links)
• Über ein graphentheoretisches Ergebnis von T. Gallai (Q4172084) (← links)
• On Vertex-Edge-Critically <i>n</i>-Connected Graphs (Q4305320) (← links)
• The binding number of a graph and its Anderson number (Q5666592) (← links)
• A note on the minimum size of matching-saturated graphs (Q6124420) (← links)
• Saturation numbers of joins of graphs (Q6611030) (← links)