Building graphs from colored trees
From MaRDI portal
Publication:612947
zbMATH Open1204.05091MaRDI QIDQ612947FDOQ612947
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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
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
Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15)
Cited In (7)
- Reconstruction for Colorings on Trees
- Reconstructing a Graph from its Neighborhood Lists
- Title not available (Why is that?)
- Generation of colour-constrained spanning trees with application in symbolic circuit analysis
- CONSTRUCTING RED-BLACK TREE SHAPES
- Graphs with prescribed local neighborhoods of their universal coverings
- On generating series of coloured planar trees
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)
