Chromatically unique multibridge graphs

MaRDI QIDQ1422157zbMATH OpenFDO

Authors K. M. Koh, F. M. Dong, K. L. Teo, C. H. C. Little, M. D. Hendy

Publication date 5 February 2004

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/123233, http://www.emis.de/journals/EJC/Volume_11/Abstracts/v11i1r12.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

chromatic polynomialspolygon-tree

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• The chromaticity of a family of \(G_k(a,b;c,d)\) graphs
• Chromatically unique 6-bridge graph \(\theta(a,a,a,b,b,c)\)
• Chromaticity of the graph (a,b,c,d,e)
• A family of chromatically unique 6-bridge graphs.
• Chromaticity of the 6-bridge graph (a,a,a,b,c,c)

Cited in

(9)

• The chromaticity of s-bridge graphs and related graphs
• On T-chromatic uniqueness of graphs
• The chromatic uniqueness of 6-bridge graphs
• A new family of chromatically unique 6-bridge graph
• The chromaticity of a family of \(G_k(a,b;c,d)\) graphs
• Patterns in Khovanov link and chromatic graph homology
• Chromatically unique 6-bridge graph \(\theta(a,a,a,b,b,c)\)
• Chromatically unique 6-bridge graphs \(\theta(r, r, r, s, t, u)\)
• Series-parallel chromatic hypergraphs

This page was built for publication: Chromatically unique multibridge graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1422157)