scientific article; zbMATH DE number 637295

MaRDI QIDQ4304346zbMATH OpenFDO

Authors Thom Porter

Publication date 14 February 1995

zbMATH Keywords

partition

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35)

Recommendations

• Graph partitions. II
• On a bottleneck bipartition conjecture of Erdős
• On judicious bipartitions of graphs

Cited in

(27)

• Judicious \(k\)-partitions of graphs
• Partitioning graphs into complete and empty graphs
• On a bottleneck bipartition conjecture of Erdős
• Bilinear and trilinear partitions of a graph
• Partitions of graphs with high minimum degree or connectivity.
• Graphs vertex-partitionable into strong cliques
• Cycle-saturated graphs of minimum size
• Nullspace vertex partition in graphs
• Graph partitions. II
• Partitioning chordal graphs
• General introduction to graph partitioning
• Partitions of Graphs
• Factorization-Based Graph Repartitionings
• scientific article; zbMATH DE number 6501141 (Why is no real title available?)
• scientific article; zbMATH DE number 3889586 (Why is no real title available?)
• Partitioning Planar Graphs
• scientific article; zbMATH DE number 2043366 (Why is no real title available?)
• scientific article; zbMATH DE number 2058456 (Why is no real title available?)
• scientific article; zbMATH DE number 1792660 (Why is no real title available?)
• Partitioning a graph into minimum gap components
• scientific article; zbMATH DE number 2227473 (Why is no real title available?)
• scientific article; zbMATH DE number 4187858 (Why is no real title available?)
• Partitioning a graph into complementary subgraphs
• Graph partition into small cliques
• Partitions of large Rado graphs
• Partitioning multi-edge graphs
• Max \(k\)-cut and judicious \(k\)-partitions

This page was built for publication:

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