Onq-trees
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1071406
- Tree approximation in quasi-trees
- The \(q\)-Calkin-Wilf tree
- Quad-K-d trees
- A q-analogue of the path length of binary search trees
- scientific article; zbMATH DE number 1741002
- On the compatibility of quartet trees
- On the compatibility of quartet trees
- scientific article; zbMATH DE number 3269730
- On binary search trees
Cited in
(21)- On the first-order edge tenacity of a graph
- On q-graphs
- Classes of chromatically equivalent graphs and polygon trees
- A bibliography on chromatic polynomials
- Chromatic polynomials of generalized trees
- On the chromatic uniqueness of the graph \(W(n,n-2)+K_ k\)
- On the chromaticity of certain subgraphs of a q-tree
- A coding algorithm for Rényi trees
- On the chromaticity of the 2-degree integral subgraph of q-trees
- On graphs in which any pair of colour classes but one induces a tree
- On the structure and chromaticity of graphs in which any two colour classes induce a tree
- On the chromatic equivalence class of graphs
- Chromaticity of integral subgraph of \(q_{q-2}\)-tree
- A characterization of chromatically rigid polynomials
- scientific article; zbMATH DE number 4168710 (Why is no real title available?)
- scientific article; zbMATH DE number 4089576 (Why is no real title available?)
- Chromaticity of two-trees
- Colourings of (k-r,k)-trees
- Chromaticity of chordal graphs
- scientific article; zbMATH DE number 1798164 (Why is no real title available?)
- scientific article; zbMATH DE number 7145382 (Why is no real title available?)
This page was built for publication: Onq-trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3718732)
