Splitting Edge Partitions of Graphs

DOI10.1556/314.2023.00002MaRDI QIDQ6097409zbMATH OpenOpenAlexFDO

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

Publication date 5 June 2023

Published in Mathematica Pannonica (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

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

zbMATH Keywords

branching ruleclique numbercoloring the nodesmaximum cliquepreconditioning

Mathematics Subject Classification ID

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

Recommendations

• Edge clique partition in \((k,\ell)\)-graphs
• Decomposing clique search problems into smaller instances based on node and edge colorings
• Metric space method for constructing splitting partitions of graphs
• The clique-partitioning problem
• On clique partitions of split graphs

Cited in

(7)

• scientific article; zbMATH DE number 5919774 (Why is no real title available?)
• On partitioning the edges of graphs into connected subgraphs
• scientific article; zbMATH DE number 1342136 (Why is no real title available?)
• Successive partition of edges of bipartite graph into matchings
• scientific article; zbMATH DE number 5194482 (Why is no real title available?)
• scientific article; zbMATH DE number 2204095 (Why is no real title available?)
• Partitioning multi-edge graphs

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

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