Decompositions of graphs based on a new graph product

DOI10.1016/J.DAM.2018.12.014MaRDI QIDQ1735673zbMATH OpenOpenAlexWikidataFDO

Authors Antoon H. Boode, Hajo Broersma

Publication date 28 March 2019

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

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

zbMATH Keywords

graph decompositionproduct graphsynchronising processesvertex-removing synchronised product

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Note on decompositions based on the vertex-removing synchronised graph product
• Graph decompositions for cartesian products
• A linear-time algorithm for computing the prime decomposition of a directed graph with regard to the Cartesian product
• Decomposition of product graphs into paths and stars on five vertices
• Decomposition of product graphs into paths and stars with three edges

Cites work

• Communicating sequential processes
• Graph theory
• Handbook of product graphs
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 1283472 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• On a directed tree problem motivated by a newly introduced graph product

Cited in

(4)

• A new view toward vertex decomposable graphs
• Note on decompositions based on the vertex-removing synchronised graph product
• Graph products and new solutions to Oberwolfach problems
• A unified method for eigendecomposition of graph products

This page was built for publication: Decompositions of graphs based on a new graph product

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