On algorithmic certification of graph structures

MaRDI QIDQ6583046zbMATH OpenFDO

Authors Oliver Bachtler

Publication date 5 August 2024

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• On the structure of a smallest counterexample and a new class verifying the 2-decomposition conjecture
• Decomposition of cubic graphs with a 2-factor consisting of three cycles
• A simple certifying algorithm for 3-edge-connectivity
• On graph decomposition: Hajós' conjecture, the clustering coefficient and dominating sets
• Decomposing planar cubic graphs

This page was built for publication: On algorithmic certification of graph structures

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