Partitioning a Graph into Highly Connected Subgraphs

DOI10.1002/jgt.21904zbMath1342.05110arXiv1401.2696MaRDI QIDQ3188667

Narayanan N., Michitaka Furuya, Shinya Fujita, Michael Ferrara, Derrick Stolee, Valentin Borozan, Yannis Manoussakis

Publication date: 12 August 2016

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

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

zbMATH Keywords

\(k\)-proper partition of a graph

Mathematics Subject Classification ID

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

05C40: Connectivity

Related Items

Highly connected subgraphs of graphs with given independence number (extended abstract), Highly connected subgraphs of graphs with given independence number, 2-proper partition of a graph

Cites Work

• Unnamed Item
• Factors and factorizations of graphs. Proof techniques in factor theory
• Partition of graphs with condition on the connectivity and minimum degree
• Graph factors and factorization: 1985--2003: a survey
• Making the components of a graph \(k\)-connected
• A look at cycles containing specified elements of a graph
• Advances on the Hamiltonian problem -- a survey
• A clustering algorithm based on graph connectivity
• Conditions for families of disjoint \(k\)-connected subgraphs in a graph
• Recent advances on the Hamiltonian problem: survey III
• Note on Hamilton Circuits
• On the editing distance of graphs
• What is the furthest graph from a hereditary property?
• Graph decomposition with constraints on the connectivity and minimum degree
• Updating the hamiltonian problem—A survey