A characterization of partition-good and partition-wonderful complete multipartite graphs

MaRDI QIDQ6500620zbMATH OpenFDO

Authors P. D. jun. Johnson, Shayne Nochumson

Publication date 10 May 2024

Published in International Journal of Mathematics and Computer Science (Search for Journal in Brave)

zbMATH Keywords

partitionconnected graphinduced subgraphcomplete multipartite graph

Mathematics Subject Classification ID

Connectivity (05C40) Density (toughness, etc.) (05C42) Graph theory (05C99)

Recommendations

• Vertex partition of a complete multipartite graph into two kinds of induced subgraphs
• On partitional and other related graphs
• Well-partitioned and balanced well-partitioned graphs.
• On partitioning the edges of graphs into connected subgraphs
• Bipartition of graph under degree constraints

This page was built for publication: A characterization of partition-good and partition-wonderful complete multipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6500620)