4-factor-criticality of vertex-transitive graphs

zbMath1339.05187arXiv1409.2117MaRDI QIDQ726659

Wuyang Sun, Heping Zhang

Publication date: 13 July 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

matchingconnectivityvertex-transitive graph4-factor-criticality

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On super 2-restricted and 3-restricted edge-connected vertex transitive graphs
• \(k\)-restricted edge-connectivity in triangle-free graphs
• Matching theory
• On n-extendable graphs
• Extraconnectivity of graphs with large girth
• On the edge connectivity, Hamiltonicity, and toughness of vertex-transitive graphs
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• On 2-extendable abelian Cayley graphs
• Extendability and factor-criticality
• Minimale \(n\)-fach kantenzusammenhängende Graphen
• On k-factor-critical graphs
• 3-Factor-Criticality of Vertex-Transitive Graphs
• On extendability of Cayley graphs
• Connectivity of transitive graphs
• On the structure of factorizable graphs

This page was built for publication: 4-factor-criticality of vertex-transitive graphs