The inductive graph dimension from the minimum edge clique cover

DOI10.1007/s00373-021-02381-yzbMath1479.05310arXiv2012.10362OpenAlexW3185259310MaRDI QIDQ2053725

Kassahun Betre, Evatt Salinger

Publication date: 30 November 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2012.10362

zbMATH Keywords

joinminimum clique coverinductive graph dimensionpure graphs

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• A discrete Gauss-Bonnet type theorem
• On the dimension of a graph
• Combinatorial algebraic topology
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The inductive graph dimension from the minimum edge clique cover