Partitioning infinite trees

DOI10.1002/1097-0118(200006)34:2%3C113::AID-JGT1%3E3.0.CO;2-0zbMATH Open0952.05025OpenAlexW4250547642MaRDI QIDQ4489487FDOQ4489487

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

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

zbMATH Keywords

treepartitionmaximum degreecolor

Mathematics Subject Classification ID

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

Cited In (6)

• Bisection of trees and sequences
• Tree-partitions of infinite graphs
• Lazy tree splitting
• Large discrete parts of the E-tree
• Title not available (Why is that?)
• Note on vertex-partitions of infinite graphs

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)