Balanced decomposition of a vertex-colored graph

DOI10.1016/J.DAM.2008.01.006zbMath1178.05075OpenAlexW1977623672MaRDI QIDQ1003723

Shinya Fujita, Tomoki Nakamigawa

Publication date: 4 March 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.01.006

zbMATH Keywords

vertex partitiongraph decompositionbalanced decomposition numberbalanced vertex coloring

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (6)

Generalized matrix projective synchronization of general colored networks with different-dimensional node dynamics ⋮ Adaptive synchronization and pinning control of colored networks ⋮ On a conjecture on the balanced decomposition number ⋮ On the balanced decomposition number ⋮ Balanced \(k\)-decompositions of graphs ⋮ Graphs with small balanced decomposition numbers

Cites Work

• An improved linear edge bound for graph linkages
• Unnamed Item

This page was built for publication: Balanced decomposition of a vertex-colored graph