scientific article; zbMATH DE number 5259899

MaRDI QIDQ5453046zbMATHFDO

Authors Bing Wang

Publication date 4 April 2008

zbMATH Keywords

\(k\)-factortough\(2\)-connected graph

Mathematics Subject Classification ID

Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• An Ore-type condition for the existence of \(k\)-factors in graphs
• Some Ore-type conditions for the existence of connected \([2,k]\)-factors in graphs
• \(K_\ell^-\)-factors in graphs
• AN ORE-TYPE CONDITION FOR THE EXISTENCE OF EVEN [a,b]-FACTORS IN GRAPHS
• Properties of fractional \(k\)-factors of graphs
• On \(k\)-factor-critical graphs
• Ore-type conditions for the existence of even \([2,b]\)-factors in graphs
• Degree conditions and fractional \(k\)-factors of graphs
• On 2-edge-connected \([\mathbf{a,b}]\)-factors of graphs with Ore-type condition
• Refining the graph density condition for the existence of almost \(K\)-factors

Cited in

(1)

• DisjointT-paths in tough graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5453046)