On A Directed Tree Problem Motivated by A Newly Introduced Graph Product

DOI10.5614/ejgta.2015.3.2.5zbMath1467.68136OpenAlexW1913804228MaRDI QIDQ5006563

Antoon H. Boode, Jan F. Broenink, Hajo J. Broersma

Publication date: 16 August 2021

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5614/ejgta.2015.3.2.5

zbMATH Keywords

finite deterministic directed acyclic labelled multi-graphsperiodic real-time systemstarget treesvertex-removing synchronised graph product

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76)

Related Items (2)

Note on decompositions based on the vertex-removing synchronised graph product ⋮ Decompositions of graphs based on a new graph product

Cites Work

• Exponential polynomials
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On A Directed Tree Problem Motivated by A Newly Introduced Graph Product