Building graphs from colored trees

MaRDI QIDQ612947zbMATHFDO

Authors Rachel M. Esselstein, Peter Winkler

Publication date 16 December 2010

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/230737

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Graph-Theoretic Concepts in Computer Science
• Recoloring graphs via tree decompositions
• Generalized coloring for tree-like graphs
• scientific article; zbMATH DE number 512918
• Multicolored trees in complete graphs
• Multicolored trees in complete graphs
• Constructing trees in bipartite graphs
• Reconstruction for Colorings on Trees
• Properly colored spanning trees in edge-colored graphs
• On generating series of coloured planar trees

Cited in

(7)

• Generation of colour-constrained spanning trees with application in symbolic circuit analysis
• Reconstructing a Graph from its Neighborhood Lists
• scientific article; zbMATH DE number 20509 (Why is no real title available?)
• Reconstruction for Colorings on Trees
• CONSTRUCTING RED-BLACK TREE SHAPES
• On generating series of coloured planar trees
• Graphs with prescribed local neighborhoods of their universal coverings

This page was built for publication: Building graphs from colored trees

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