q-partitioning of graphs with finite coordination number

DOI10.1088/0305-4470/21/22/001zbMath0693.05053OpenAlexW2022396479MaRDI QIDQ3035331

Yadin Y. Goldschmidt, Pik-Yin Lai

Publication date: 1988

Published in: Journal of Physics A: Mathematical and General (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1088/0305-4470/21/22/001

zbMATH Keywords

simulations3-partitions of random graphsq-partitioning of graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Phase transitions in optimized network models

This page was built for publication: q-partitioning of graphs with finite coordination number