The search for chromatically unique graphs
From MaRDI portal
Publication:803145
DOI10.1007/BF01787578zbMATH Open0727.05023OpenAlexW1989719968MaRDI QIDQ803145FDOQ803145
Publication date: 1990
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01787578
Recommendations
Cites Work
- The chromatic uniqueness of certain broken wheels
- Graph theory with applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- An introduction to chromatic polynomials
- Title not available (Why is that?)
- On chromatic coefficients
- Chromatic uniqueness of the generalized \(\Theta\)-graph
- Chromatic classes of 2-connected \((n,n+3)\)-graphs with at least two triangles
- Cutpoints and the chromatic polynomial
- Title not available (Why is that?)
- On maximally saturated graphs
- Title not available (Why is that?)
- Chromatically unique graphs
- Title not available (Why is that?)
- The chromaticity of wheels
- On the chromatic uniqueness of bipartite graphs
- Chromatic uniqueness and equivalence ofK4 homeomorphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Two classes of chromatically unique graphs
- The chromaticity of wheels with a missing spoke
- Chromatic polynomials of connected graphs
- A note on the chromatic uniqueness of \(W_ 10\)
- Chromatic polynomials for regular graphs and modified wheels
- Title not available (Why is that?)
- The chromaticity of complete bipartite graphs with at most one edge deleted
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On 3-colorings of bipartitep-threshold graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Chromatic polynomials and whitney's broken circuits
- Classification of chromatically unique graphs having quadratic σ‐polynomials
- A note on chromatic uniqueness of graphs
Cited In (66)
- Some families of chromatically unique bipartite graphs
- The chromaticity of wheels with a missing spoke. II
- Two classes of chromatically unique graphs
- The number of shortest cycles and the chromatic uniqueness of a graph
- Graphs determined by polynomial invariants
- Some new results on chromatic uniqueness of \(K_4\)-homeomorphs
- Classes of chromatically equivalent graphs and polygon trees
- On the chromaticity of sunflower hypergraphs \(\text{SH}(n,p,h)\)
- A bibliography on chromatic polynomials
- Divisibility of certain coefficients of the chromatic polynomials.
- The chromatic uniqueness of certain complete \(t\)-partite graphs.
- Graph homomorphisms, the tutte polynomial and ``\(q\)-state Potts uniqueness
- On the chromatic uniqueness of the graph \(W(n,n-2)+K_ k\)
- On the chromatic uniqueness of the graph \(W(n,n-2,k)\)
- Chromatic coefficients of linear uniform hypergraphs
- Chromatic uniqueness of a family of \(K_4\)-homeomorphs
- Classification of complete 5-partite graphs and chromaticity of 5-partite graphs with \(5n\) vertices
- Colorings of the Graph K ᵐ 2 + Kn
- A new method for proving chromatic uniqueness of graphs
- Adjoint polynomials and chromatically unique graphs
- Some results on chromaticity of quasilinear hypergraphs
- A complete solution to a conjecture on chromatic uniqueness of complete tripartite graphs
- Chromaticity of a family of \(K_ 4\) homeomorphs
- On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs
- On graphs in which any pair of colour classes but one induces a tree
- ON CHROMATIC UNIQUENESS OF SOME COMPLETE TRIPARTITE GRAPHS
- Structures and chromaticity of some extremal 3-colourable graphs
- On the structure and chromaticity of graphs in which any two colour classes induce a tree
- Chromatic uniqueness of elements of height \(\leq 3\) in lattices of complete multipartite graphs
- Distinguishing graphs by their left and right homomorphism profiles
- On matroids determined by their Tutte polynomials
- Chromatic uniqueness of atoms in lattices of complete multipartite graphs
- Sunflower hypergraphs are chromatically unique
- On chromatic uniqueness of uniform subdivisions of graphs
- Splittings of toric ideals
- A note on chromatic uniqueness of graphs
- On the chromaticity of complete multipartite graphs with certain edges added
- Chromaticity of complete 6-partite graphs with certain star or matching deleted. II
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some problems on chromatic polynomials
- Title not available (Why is that?)
- On chromatic and flow polynomial unique graphs
- Chromatic uniqueness in a family of 2-connected graphs
- A complete solution to the chromatic equivalence class of graph \(\overline {B_{n-7,1,3}}\)
- Chromatic uniqueness of the complements of certain forests
- Chromatic equivalence classes of certain generalized polygon trees. III
- About chromatic uniqueness of some complete tripartite graphs
- The search for chromatically unique graphs. II
- On \(\sigma\)-polynomials and a class of chromatically unique graphs
- Another family of chromatically unique graphs
- All wheels with two missing consecutive spokes are chromatically unique
- Chromaticity of series-parallel graphs
- Contraction-deletion invariants for graphs
- Chromatic equivalence classes of complete tripartite graphs
- Title not available (Why is that?)
- A new family of chromatically unique 6-bridge graph
- On Garlands in \(\chi\)-uniquely colorable graphs
- The chromaticity of complete split graphs
- Title not available (Why is that?)
- Chromatically unique 6-bridge graph theta(a,a,a,b,b,c)
- Title not available (Why is that?)
- Hypergraphs with pendant paths are not chromatically unique
- Chromatic polynomials of some nanostars
- New result on chromaticity of \(K_{4}\)-homeomorphic graphs
- On chromatic uniqueness of certain 5-partite graphs
This page was built for publication: The search for chromatically unique graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q803145)
