Matching of \(5-\gamma \)-critical leafless graph with a cut edge

DOI10.1016/J.AMC.2017.11.050zbMath1426.05140OpenAlexW2771383233MaRDI QIDQ2423119

Yuxuan Yang, Mei Lu

Publication date: 21 June 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2017.11.050

zbMATH Keywords

perfect matchingdomination numbercriticalnontrivial cut edge

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• The structure of \(4-\gamma \)-critical graphs with a cut vertex
• Some results related to the toughness of 3-domination critical graphs
• Matching properties in domination critical graphs.
• Hamilton-connectivity of 3-domination critical graphs with \(\alpha =\delta +1\geqslant 5\)
• Hamiltonian properties of domination-critical graphs
• Domination critical graphs

This page was built for publication: Matching of \(5-\gamma \)-critical leafless graph with a cut edge