scientific article; zbMATH DE number 1228444

MaRDI QIDQ4221699zbMATH OpenFDO

Authors Qinglin Roger Yu, Guizhen Liu

Publication date 21 February 1999

zbMATH Keywords

connectivitydeletableextendablegraphmatching

Mathematics Subject Classification ID

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

Recommendations

• On i-minus-edge-removal-critical graphs
• On Vertex-Edge-Critically n-Connected Graphs
• scientific article; zbMATH DE number 1047741
• On edge-\(b\)-critical graphs
• scientific article; zbMATH DE number 68915
• Domination parameters and edge-removal-critical graphs
• On path-factor critical deleted (or covered) graphs
• On b-vertex and b-edge critical graphs
• Irredundance-edge-removal-critical graphs
• Total domination critical and stable graphs upon edge removal

Cited in

(6)

• On the degrees of vertices in locally finite graphs which possess a certain edge deletion property
• Minimum size of n-factor-critical graphs and k-extendable graphs
• On path-factor critical deleted (or covered) graphs
• Characterizing defect n-extendable graphs and (2n+1)-critical graphs
• The existence of even regular factors of regular graphs on the number of cut edges
• \(k\) -factors in regular 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 Q4221699)