Separation of Cartesian products of graphs into several connected components by the removal of vertices

DOI10.7151/dmgt.2315zbMath1492.05078OpenAlexW3016465024MaRDI QIDQ2151221

Simon Špacapan, Tjaša Paj Erker

Publication date: 1 July 2022

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2315

zbMATH Keywords

Cartesian product\(k\)-connectivity

Mathematics Subject Classification ID

Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• On the difference of two generalized connectivities of a graph
• Connectivity of Cartesian products of graphs
• On the \(\ell\)-connectivity of a graph
• On two generalized connectivities of graphs
• On the maximum and minimum sizes of a graph with given \(k\)-connectivity
• Toughness in graphs -- a survey
• Tough graphs and Hamiltonian circuits.
• On the connectivity of Cartesian product of graphs
• Graphs with Given Group and Given Graph-Theoretical Properties
• Reliability of interconnection networks modeled by Cartesian product digraphs

This page was built for publication: Separation of Cartesian products of graphs into several connected components by the removal of vertices