Partitions of Graphs

DOI10.1007/978-0-8176-4789-6_2MaRDI QIDQ3064394zbMATH OpenOpenAlexFDO

Authors Mieczysław Borowiecki

Publication date 21 December 2010

Published in Structural Analysis of Complex Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-0-8176-4789-6_2

zbMATH Keywords

partitionscomplexity\(k\)-clusteringdominationcolouringshereditary propertiescut matching

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 637295
• On partition graphs
• scientific article; zbMATH DE number 3867385
• scientific article; zbMATH DE number 4068928
• scientific article; zbMATH DE number 3889586
• Generalized partitions of graphs
• On graphical partitions
• scientific article; zbMATH DE number 2227473
• A partition of connected graphs
• Partitions of graphs into cographs

Cited in

(29)

• Partitions of large Rado graphs
• Complete partitions of graphs
• List matrix partitions of graphs representing geometric configurations
• Nullspace vertex partition in graphs
• Graph partitions. II
• Complete partitions of graphs
• Partition of a graph with its complete sub-graphs
• Coherent network partitions
• Partitioning Planar Graphs
• Graph partition into small cliques
• scientific article; zbMATH DE number 4187852 (Why is no real title available?)
• More aspects of arbitrarily partitionable graphs
• scientific article; zbMATH DE number 2061963 (Why is no real title available?)
• scientific article; zbMATH DE number 2227473 (Why is no real title available?)
• Partition-distance: A problem and class of perfect graphs arising in clustering
• Partitions of graphs into one or two independent sets and cliques
• Partitioning a graph into complementary subgraphs
• Equipartitions of graphs
• Partitioning multi-edge graphs
• Graphs vertex-partitionable into strong cliques
• Bilinear and trilinear partitions of a graph
• Partitioning graphs into complete and empty graphs
• scientific article; zbMATH DE number 2058456 (Why is no real title available?)
• Partitions of digraphs into paths or circuits
• scientific article; zbMATH DE number 3889586 (Why is no real title available?)
• scientific article; zbMATH DE number 5989953 (Why is no real title available?)
• Out-degree reducing partitions of digraphs
• General introduction to graph partitioning
• Antitwins in partitionable graphs

This page was built for publication: Partitions of Graphs

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