The chromaticity of complete bipartite graphs with at most one edge deleted
From MaRDI portal
DOI10.1002/JGT.3190140110zbMATH Open0712.05027OpenAlexW2054383364MaRDI QIDQ3496353FDOQ3496353
Authors: Chung-Piaw Teo, K. M. Koh 
Publication date: 1990
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190140110
Recommendations
Cites Work
Cited In (22)
- Some families of chromatically unique bipartite graphs
- Title not available (Why is that?)
- Graphs determined by polynomial invariants
- Title not available (Why is that?)
- A bibliography on chromatic polynomials
- The chromatic uniqueness of certain complete \(t\)-partite graphs.
- Destroying Bicolored $P_3$s by Deleting Few Edges
- Chromatic equivalence classes of complete tripartite graphs
- Title not available (Why is that?)
- On the chromatic equivalence class of graphs
- The search for chromatically unique graphs
- On chromatic uniqueness of uniform subdivisions of graphs
- The chromatic equivalence class of \(K_{1, n, n + 2}\)
- The chromaticity of \(s\)-bridge graphs and related graphs
- On the chromaticity of complete multipartite graphs with certain edges added
- Destroying bicolored \(P_3\)s by deleting few edges
- Some problems on chromatic polynomials
- Chromatic uniqueness in a family of 2-connected graphs
- Chromatic equivalence classes of certain generalized polygon trees
- Chromatic uniqueness of complete bipartite graphs with certain edges deleted.
- The search for chromatically unique graphs. II
- On the chromatic uniqueness of certain bipartite graphs
This page was built for publication: The chromaticity of complete bipartite graphs with at most one edge deleted
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3496353)
