An algebraic characterization of strong graphs

DOI10.1007/978-3-031-83438-7_23MaRDI QIDQ6969486zbMATH OpenFDO

Authors Pablo Romero

Publication date 20 June 2025

Full work available at URL https://doi.org/10.1007/978-3-031-83438-7_23

zbMATH Keywords

0-element conjecturestrong graphWhitney polynomial

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Algorithms in computer science (68Wxx)

Cites work

• A Contribution to the Theory of Chromatic Polynomials
• A determinant formula for the number of ways of coloring a map.
• A new technique for the characterization of graphs with a maximum number of spanning trees
• Extremal graphs for the Tutte polynomial
• Handbook of the Tutte polynomial and related topics
• On graphs with randomly deleted edges
• On maximum graphs in Tutte polynomial posets
• On the existence of uniformly optimally reliable networks
• On unreliability polynomials and graph connectivity in reliable network synthesis
• Reliable circuits using less reliable relays
• Separation of graphs into three components by the removal of edges
• The coloring of graphs.
• THE MAXIMUM CONNECTIVITY OF A GRAPH
• Uniformly optimally reliable graphs: A survey

This page was built for publication: An algebraic characterization of strong graphs

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