Research on fractional critical covered graphs

DOI10.1134/S0032946020030047zbMath1458.05221MaRDI QIDQ2211178

Su-fang Wang, Wei Zhang

Publication date: 12 November 2020

Published in: Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

fractional \((g, f)\)-factorbinding numberfractional \((g, f, n)\)-critical covered graphfractional \((g, f)\)-covered graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Fractional graph theory, fuzzy graph theory (05C72)

Related Items

Discussion on fractional \((a, b, k)\)-critical covered graphs ⋮ Discussions on orthogonal factorizations in digraphs ⋮ The existence of subdigraphs with orthogonal factorizations in digraphs ⋮ A Note of Generalization of Fractional ID-factor-critical Graphs ⋮ Component factors and binding number conditions in graphs ⋮ A neighborhood condition for graphs to have restricted fractional (g,f)-factors ⋮ Path factors in subgraphs ⋮ A note on fractional ID-\( [ a , b \)-factor-critical covered graphs] ⋮ An existence theorem on fractional ID-(g, f)-factor-critical covered graphs ⋮ Some results about ID-path-factor critical graphs ⋮ Remarks on component factors ⋮ Path factors and neighborhoods of independent sets in graphs ⋮ Two sufficient conditions for odd \([1,b\)-factors in graphs] ⋮ Degree conditions for the existence of a {P₂, P₅}-factor in a graph ⋮ Sufficient conditions for graphs to have strong parity factors ⋮ Toughness for fractional \((2, b, k)\)-critical covered graphs ⋮ Sun toughness and path-factor uniform graphs ⋮ Path-factor critical covered graphs and path-factor uniform graphs ⋮ Some sufficient conditions for path-factor uniform graphs ⋮ Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs ⋮ A result on fractional \((a,b,k)\)-critical covered graphs ⋮ Nash-Williams conditions for the existence of all fractional \([a,b\)-factors] ⋮ Degree conditions for \(k\)-Hamiltonian \([a,b\)-factors] ⋮ A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs ⋮ Some results on path-factor critical avoidable graphs ⋮ On \(P_{\geq 3}\)-factor deleted graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Sufficient condition for the existence of an even \([a,b\)-factor in graph]
• Generalizations of marriage theorem for degree factors
• General fractional \(f\)-factor numbers of graphs
• Characterizations of maximum fractional \((g,f)\)-factors of graphs
• Binding numbers and \(f\)-factors of graphs
• A neighbourhood condition for graphs to have \([a,b\)-factors]
• Sufficient conditions for graphs to have \((g,f)\)-factors
• The extension degree conditions for fractional factor
• A degree condition for fractional \((g, f, n)\)-critical covered graphs
• Some existence theorems on path factors with given properties in graphs
• Subgraphs with orthogonal factorizations in graphs
• Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
• Neighborhood union conditions for fractional \([a, b\)-covered graphs]
• Remarks on fractional ID-\(k\)-factor-critical graphs
• Toughness condition for the existence of all fractional \((a, b, k)\)-critical graphs
• Degree conditions for fractional \((a,b,k)\)-critical covered graphs
• A toughness condition for fractional \((k,m)\)-deleted graphs
• A result on \(r\)-orthogonal factorizations in digraphs
• Toughness, binding number and restricted matching extension in a graph
• Toughness and the existence of fractional \(k\)-factors of graphs
• Remarks on orthogonal factorizations of digraphs
• Sun toughness and $P_{\geq3}$-factors in graphs
• Remarks on path factors in graphs
• Toughness and the existence ofk-factors
• BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF k-FACTORS
• An algorithmic proof of Tutte's f-factor theorem
• Subgraphs with prescribed valencies
• Reguläre Faktoren von Graphen.