Splitting Edge Partitions of Graphs

DOI10.1556/314.2023.00002OpenAlexW4319316106MaRDI QIDQ6097409

Sándor Szabó, Balázs Király

Publication date: 5 June 2023

Published in: Mathematica Pannonica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1556/314.2023.00002

zbMATH Keywords

preconditioningclique numbermaximum cliquebranching rulecoloring the nodes

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Combinatorial aspects of tessellation and tiling problems (05B45) Tilings in (n) dimensions (aspects of discrete geometry) (52C22)

This page was built for publication: Splitting Edge Partitions of Graphs