Decompositions of graphs based on a new graph product

DOI10.1016/J.DAM.2018.12.014zbMATH Open1407.05190OpenAlexW2912663086WikidataQ128508238 ScholiaQ128508238MaRDI QIDQ1735673FDOQ1735673

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

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

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)

Cites Work

• Graph theory
• Handbook of product graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Communicating sequential processes
• Title not available (Why is that?)
• On a directed tree problem motivated by a newly introduced graph product

Cited In (4)

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

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)