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

DOI10.1016/j.disc.2024.114145zbMATH Open1545.05052MaRDI QIDQ6589122

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

Publication date: 19 August 2024

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

zbMATH Keywords

polynomial-time algorithmClar numberFries number

Mathematics Subject Classification ID

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

Cites Work

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

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)