Onq-trees

DOI10.1002/jgt.3190100116zbMath0591.05021OpenAlexW1592003035MaRDI QIDQ3718732

Shao-Ji Xu, Nian-Zu Li, Chong-Yun Chao

Publication date: 1986

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190100116

zbMATH Keywords

chromatic polynomialq-tree

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items

On the first-order edge tenacity of a graph, Classes of chromatically equivalent graphs and polygon trees, Unnamed Item, On graphs in which any pair of colour classes but one induces a tree, On the chromatic uniqueness of the graph \(W(n,n-2)+K_ k\), A bibliography on chromatic polynomials, On \(q\)-graphs, Chromatic polynomials of generalized trees, Chromaticity of chordal graphs, On the structure and chromaticity of graphs in which any two colour classes induce a tree, On the chromatic equivalence class of graphs, On the chromaticity of the 2-degree integral subgraph of \(q\)-trees, A coding algorithm for Rényi trees, Colourings of (k-r,k)-trees, A characterization of chromatically rigid polynomials

Cites Work

• The Use of S-Functions in Combinatorial Analysis