An algebraic characterization of strong graphs

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

Authors Pablo Romero

Publication date 20 June 2025

zbMATH Keywords

Whitney polynomial0-element conjecturestrong graph

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)

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)