2-proper partition of a graph

DOI10.1007/s00373-022-02599-4OpenAlexW4310022022MaRDI QIDQ2102763

Yanyan Li

Publication date: 29 November 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-022-02599-4

zbMATH Keywords

degree sumblock-cut-vertex graph2-proper partition

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• A clustering algorithm based on graph connectivity
• Highly connected subgraphs of graphs with given independence number
• Conditions for families of disjoint \(k\)-connected subgraphs in a graph
• Partitioning a Graph into Highly Connected Subgraphs
• Note on Hamilton Circuits
• Chvátal Erdős condition and 2-factors with a specyfied number of components
• Degree conditions for 2-factors
• On the maximal number of independent circuits in a graph

This page was built for publication: 2-proper partition of a graph