Minimal reducible bounds for 1-nonouterplanar graphs

DOI10.1016/S0012-365X(99)00364-7MaRDI QIDQ1567656zbMATHOpenAlexFDO

Authors Mieczysław Borowiecki, Mariusz Hałuszczak, Miroslawa Skowronska

Publication date 28 May 2001

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(99)00364-7

zbMATH Keywords

graph coloringouterplanar graphsminimal reducible bounds

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• On the minimal reducible bound for outerplanar and planar graphs
• Acyclic reducible bounds for outerplanar graphs
• scientific article; zbMATH DE number 3957172
• Minimal reducible bounds for the class of \(k\)-degenerate graphs
• Minimal non-1-planar graphs

Cited in

(1)

• Acyclic reducible bounds for outerplanar graphs

This page was built for publication: Minimal reducible bounds for 1-nonouterplanar graphs

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