Chromaticity of triangulated graphs

DOI10.1002/JGT.3190120215zbMATH Open0666.05027OpenAlexW2067054596MaRDI QIDQ3818331FDOQ3818331

Authors: Paul Vaderlind 

Publication date: 1988

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190120215

Recommendations

• On the chromaticity of certain subgraphs of a q-tree
• scientific article; zbMATH DE number 773170
• Chromatic polynomials of connected graphs
• Chromatic classes of 2-connected \((n,n+4)\)-graphs with at least four triangles.
• scientific article; zbMATH DE number 4195988

zbMATH Keywords

triangulationchromatic polynomial

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)

Cited In (13)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Chromaticity of the graph \(\theta(a,b,c,d,e)\)
• A bibliography on chromatic polynomials
• Title not available (Why is that?)
• Integral-root polynomials and chromatic uniqueness of graphs
• Title not available (Why is that?)
• Trapezoid graphs and their coloring
• Title not available (Why is that?)
• Some problems on chromatic polynomials
• Title not available (Why is that?)
• On chordal graphs and their chromatic polynomials
• Chromaticity of chordal graphs

This page was built for publication: Chromaticity of triangulated graphs

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