Adjoint polynomials and chromatically unique graphs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3904612 (Why is no real title available?)
- scientific article; zbMATH DE number 151783 (Why is no real title available?)
- scientific article; zbMATH DE number 1214963 (Why is no real title available?)
- scientific article; zbMATH DE number 1094005 (Why is no real title available?)
- scientific article; zbMATH DE number 1153017 (Why is no real title available?)
- scientific article; zbMATH DE number 3445271 (Why is no real title available?)
- An introduction to chromatic polynomials
- An introduction to matching polynomials
- Chromatic polynomials of complementary graphs of trees.
- Chromatic uniqueness of a class of graphs
- Classification of chromatically unique graphs having quadratic σ‐polynomials
- Graph theory with applications
- On \(\sigma\)-polynomials
- On \(\sigma\)-polynomials and a class of chromatically unique graphs
- On chromatic equivalence of graphs
- On graphs having -polynomials of the same degree
- The search for chromatically unique graphs
- Two new classes of chromatically unique graphs
- \(\sigma\)-polynomials and graph coloring
Cited in
(10)- The chromatic equivalence classes of the complements of graphs with the minimum real roots of their adjoint polynomials greater than -4
- On problems and conjectures on adjointly equivalent graphs
- A bibliography on chromatic polynomials
- On the roots of \(\sigma\)-polynomials
- On the minimum real roots of the adjoint polynomial of a graph
- On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs
- A complete solution to the chromatic equivalence class of graph \(\overline {B_{n-7,1,3}}\)
- New families of adjointly unique graphs
- The roots of -polynomials
- The search for chromatically unique graphs. II
This page was built for publication: Adjoint polynomials and chromatically unique graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1366781)
