Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs

DOI10.1016/j.dam.2015.10.016zbMath1333.05102arXiv1501.04388OpenAlexW2963289578MaRDI QIDQ266794

Boris Brimkov, Illya V. Hicks

Publication date: 7 April 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1501.04388

zbMATH Keywords

chromatic polynomialflow polynomialouterplanar graphvertex joinwheel graph

Mathematics Subject Classification ID

Trees (05C05) Graph polynomials (05C31) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

The Tutte polynomial of a class of compound graphs and its applications

Uses Software

• Algorithm 447

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nowhere-zero 3-flows and modulo \(k\)-orientations
• Inapproximability of the Tutte polynomial
• Tutte polynomials of flower graphs
• On trees of polygons
• Chromatic polynomials of generalized trees
• Limits of chromatic zeros of some families of maps
• The chromatic uniqueness of certain broken wheels
• Characterizations of outerplanar graphs
• A note on finding the bridges of a graph
• Chromatic roots and Hamiltonian paths
• Graph Polynomials and Their Applications I: The Tutte Polynomial
• Chromatic, Flow and Reliability Polynomials: The Complexity of their Coefficients
• Chromaticity of two-trees
• Chromatic polynomials, polygon trees, and outerplanar graphs
• Efficient Planarity Testing
• On chromaticity of graphs
• Some polynomials of flower graphs

This page was built for publication: Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs