Some Results on Fractional Graph Theory

DOI10.1007/978-3-540-89550-3_12zbMath1162.05346OpenAlexW206198638MaRDI QIDQ5302745

Gui Zhen Liu

Publication date: 13 January 2009

Published in: Computational Geometry and Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89550-3_12

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• A simple existence criterion for \((g<f)\)-factors
• Matching theory
• Fractional matchings and the Edmonds-Gallai theorem
• Lexicographic matchings cannot form Hamiltonian cycles
• Properties of fractional \(k\)-factors of graphs
• Factors and factorizations of graphs—a survey
• Integer and Fractional Matchings
• The fractional matching numbers of graphs
• An algorithmic proof of Tutte's f-factor theorem
• Subgraphs with prescribed valencies
• The Factors of Graphs
• Fractional \((g,f)\)-factors of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item