A network flow approach to a common generalization of Clar and Fries numbers

DOI10.1016/J.DISC.2024.114145MaRDI QIDQ6589122zbMATH OpenFDO

Authors Erika R. Bérczi-Kovács, András Frank

Publication date 19 August 2024

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2024.114145

zbMATH Keywords

Clar numberFries numberpolynomial-time algorithm

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Directed graphs (digraphs), tournaments (05C20)

Recommendations

• scientific article; zbMATH DE number 1522741
• The complexity of the Clar number problem and an exact algorithm
• scientific article; zbMATH DE number 1187153
• A min-max theorem for plane bipartite graphs
• Unimodularity of the Clar number problem

Cites work

• A mathematical programming model for computing the fries number of a fullerene
• A min-max theorem for plane bipartite graphs
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• Clar and fries numbers for benzenoids
• Clar chains and a counterexample
• Clar structures vs Fries structures in hexagonal systems
• Connections in combinatorial optimization
• How to Draw a Graph
• scientific article; zbMATH DE number 3121293 (Why is no real title available?)
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 3047038 (Why is no real title available?)
• Maximum-Minimum Sätze über Graphen
• Minmax relations for cyclically ordered digraphs
• Sink-Stable Sets of Digraphs
• Spannning a strong digraph by \(\alpha\) circuits: a proof of Gallai's conjecture
• The complexity of the Clar number problem and an exact algorithm
• The maximum number of alternating hexagonal faces in (4, 6)-fullerenes
• Unimodularity of the Clar number problem

This page was built for publication: A network flow approach to a common generalization of Clar and Fries numbers

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