Hamilton cycles and quotients of bipartite graphs
Graph theory with applications to algorithms and computer science
Fractional matchings and the Edmonds-Gallai theorem
Discrete Applied Mathematics
A simple existence criterion for (g)-factors
Discrete Mathematics
Matching Theory (North-Holland mathematics studies)
Matching Theory (North-Holland mathematics studies)
Hi-index | 0.00 |
We will convert integer-based definitions and invariants into their fractional analogues. Some results on fractional factors, fractional Hamiltonian graphs, fractional (g ,f )-factors and fractional colorings are presented. The relationships of the programming and the graph theory are discussed. In particular, some new results related to fractional (g ,f )-factors obtained by us are given. Furthermore, some open problems are presented.