On chromatic equivalence of graphs

From MaRDI portal
Publication:4148003

DOI10.1007/BFb0070369zbMath0369.05032OpenAlexW245060393MaRDI QIDQ4148003

Earl Glen jun. Whitehead, Chong-Yun Chao

Publication date: 1978

Published in: Lecture Notes in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0070369




Related Items (43)

Independence Equivalence Classes of Paths and CyclesSunflower hypergraphs are chromatically uniqueClasses of chromatically equivalent graphs and polygon treesGraphs determined by polynomial invariantsThe chromaticity of \(s\)-bridge graphs and related graphsOn the chromaticity of quasi linear hypergraphsA new method for proving chromatic uniqueness of graphsSome problems on chromatic polynomialsAdjoint polynomials and chromatically unique graphsA bibliography on chromatic polynomialsChromatic polynomials of generalized treesOn the chromaticity of sunflower hypergraphs \(\text{SH}(n,p,h)\)Chromaticity of series-parallel graphsOn chromaticity of hypergraphsChromatic classes of 2-connected \((n, n + 4)\)-graphs with exactly three triangles and at least two induced 4-cyclesChromatic polynomials for regular graphs and modified wheelsTwo classes of chromatically unique graphsThe chromatic uniqueness of certain complete \(t\)-partite graphs.Short certificates for chromatic equivalenceThe chromaticity of wheels with a missing spokeOn maximally saturated graphsChromatic classes of 2-connected \((n,n+4)\)-graphs with at least four triangles.A new family of chromatically unique 6-bridge graphIndependence equivalence classes of cyclesOn the chromatic uniqueness of certain bipartite graphsOn chromatic and flow polynomial unique graphsHypergraphs with pendant paths are not chromatically uniqueChromaticity of a family of \(K_ 4\)-homeomorphsSeries-parallel chromatic hypergraphsChromatic uniqueness of the generalized \(\Theta\)-graphZeroth-order general Randić index of cactus graphsChromatically unique graphsChromatic coefficients of linear uniform hypergraphsChromatic classes of 2-connected \((n,n+4)\)-graphs with three triangles and one induced 4-cycleClassification of chromatically unique graphs having quadratic σ‐polynomialsOn the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphsOn the chromaticity of complete multipartite graphs with certain edges addedSome families of chromatically unique bipartite graphsChromatically unique 6-bridge graph theta(a,a,a,b,b,c)Contraction-deletion invariants for graphsColorings of the Graph K ᵐ 2 + KnThe chromaticity of wheelsOn chromatic uniqueness of uniform subdivisions of graphs




This page was built for publication: On chromatic equivalence of graphs