Partitioning infinite trees

DOI10.1002/1097-0118(200006)34:2%3C113::AID-JGT1%3E3.0.CO;2-0MaRDI QIDQ4489487zbMATH OpenOpenAlexFDO

Authors Peter Horák, Katherine Heinrich

Publication date 28 December 2000

Full work available at URL https://doi.org/10.1002/1097-0118(200006)34:2%3C113::aid-jgt1%3E3.0.co;2-0

zbMATH Keywords

colormaximum degreepartitiontree

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15)

Recommendations

• scientific article; zbMATH DE number 1011081
• scientific article; zbMATH DE number 1866895
• Bisection of trees and sequences
• Monochromatic trees with respect to edge partitions
• Uniform coloring of trees

Cited in

(8)

• Tree-partitions of infinite graphs
• Note on vertex-partitions of infinite graphs
• On the bijective colouring of Cantor trees based on transducers
• Large discrete parts of the E-tree
• scientific article; zbMATH DE number 1011081 (Why is no real title available?)
• scientific article; zbMATH DE number 2065939 (Why is no real title available?)
• Lazy tree splitting
• Bisection of trees and sequences

This page was built for publication: Partitioning infinite trees

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