A relationship between trees and Kelly–Mac Lane graphs

DOI10.1017/S0305004105009060zbMATH Open1093.05016arXivmath/0304287OpenAlexW2963249019MaRDI QIDQ5481576FDOQ5481576

Authors: Eugenia Cheng 

Publication date: 10 August 2006

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

Abstract: We give a precise description of combed trees in terms of Kelly-Mac Lane graphs. We show that any combed tree is uniquely expressed as an allowable Kelly-Mac Lane graph of a certain shape. Conversely, we show that any such Kelly-Mac Lane graph uniquely defines a combed tree.

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

Recommendations

• Relations between adjacency trees
• On connectivities of tree graphs
• The relationships among several labelings of trees
• The connectivities of adjacent tree graphs
• \(k\)-tree connectivity of line graphs
• \(k\)-trees and some graph operators
• On tree-connectivity and path-connectivity of graphs
• On k-pairable graphs from trees
• scientific article; zbMATH DE number 4103086
• A note on \(k\)-rainbow connection in trees

zbMATH Keywords

opetopescombed tree

Mathematics Subject Classification ID

Trees (05C05)

Cited In (1)

• Polynomial functors and opetopes

This page was built for publication: A relationship between trees and Kelly–Mac Lane graphs

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