On the chromatic equivalence class of graphs
From MaRDI portal
Publication:1377862
DOI10.1016/S0012-365X(97)81814-6zbMATH Open0918.05048MaRDI QIDQ1377862FDOQ1377862
Authors: Gek L. Chia 
Publication date: 10 August 1999
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Cites Work
- On trees of polygons
- Chromaticity of two-trees
- Onq-trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- An introduction to chromatic polynomials
- Cutpoints and the chromatic polynomial
- Title not available (Why is that?)
- 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?)
- A note on chromatic uniqueness of graphs
- Title not available (Why is that?)
- On graphs in which any pair of colour classes but one induces a tree
- On the chromatic equivalence class of a family of graphs
- On the chromaticity of certain subgraphs of a q-tree
- Title not available (Why is that?)
Cited In (14)
- Title not available (Why is that?)
- Pairs of chromatically equivalent graphs
- Classes of chromatically equivalent graphs and polygon trees
- A bibliography on chromatic polynomials
- Title not available (Why is that?)
- Classes of graphs with \(e\)-positive chromatic symmetric function
- Classes of chromatically unique or equivalent graphs
- On the chromatic equivalence class of a family of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Chromatic equivalence classes of certain generalized polygon trees
- Chromatic equivalence classes of certain generalized polygon trees. III
- The chromaticity of certain cycles with edges
- Title not available (Why is that?)
This page was built for publication: On the chromatic equivalence class of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1377862)
