3-Factor-Criticality of Vertex-Transitive Graphs

DOI10.1002/jgt.21873zbMath1333.05249arXiv1212.3940OpenAlexW1606974704MaRDI QIDQ2800542

Heping Zhang, Wuyang Sun

Publication date: 15 April 2016

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1212.3940

zbMATH Keywords

matchingconnectivityvertex-transitive graphfactor-criticality

Mathematics Subject Classification ID

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

Related Items

Some sufficient conditions for a graph with minimum degree to be \(k\)-factor-critical ⋮ 4-factor-criticality of vertex-transitive graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On cyclic edge-connectivity of transitive graphs
• On n-extendable graphs
• Super restricted edge-connectivity of vertex-transitive graphs
• Extendability and factor-criticality
• Minimale \(n\)-fach kantenzusammenhängende Graphen
• On k-factor-critical graphs
• Small separations in vertex-transitive graphs
• Connectivity of transitive graphs
• On the structure of factorizable graphs