Complete family reduction and spanning connectivity in line graphs

DOI10.1016/j.disc.2022.113210zbMath1502.05217OpenAlexW4301180137MaRDI QIDQ2092434

Wei Xiong, Fengxia Liu, Yang Wu, Hong-Jian Lai, Mingquan Zhan

Publication date: 2 November 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2022.113210

zbMATH Keywords

reductionconnectivityline graphreductionsspanning connectivitycontraction obstacles

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nowhere-zero 3-flows and modulo \(k\)-orientations
• The spanning connectivity of line graphs
• Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid
• Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs
• Degree conditions for group connectivity
• Hamiltonian connectedness in 3-connected line graphs
• The reduction of graph families closed under contraction
• Graphs without spanning closed trails
• Duality in graph families
• On a closure concept in claw-free graphs
• Eulerian subgraphs and Hamilton-connected line graphs
• Note on edge-disjoint spanning trees and eigenvalues
• Supereulerian width of dense graphs
• On spanning disjoint paths in line graphs
• Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
• Hamiltonian results inK1,3-free graphs
• A reduction method to find spanning Eulerian subgraphs
• Reflections on graph theory
• On Mod $(2s+1)$-Orientations of Graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Decomposition of Finite Graphs Into Forests
• Graph family operations