Acyclic reducible bounds for outerplanar graphs

DOI10.7151/DMGT.1443MaRDI QIDQ3559375zbMATH OpenOpenAlexFDO

Authors Mieczysław Borowiecki, Anna Fiedorowicz, Mariusz Hałuszczak

Publication date 14 May 2010

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/1a7d5ebb9e592c87b713f1466b8dc86070ea17ff

zbMATH Keywords

graphouterplanar graphacyclic colouringadditive hereditary class

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75)

Recommendations

• On the minimal reducible bound for outerplanar and planar graphs
• Minimal reducible bounds for 1-nonouterplanar graphs
• Minimal reducible bounds for planar graphs
• A generalization of outerplanar graphs
• A generalization of outerplanar graphs
• An upper bound on the algebraic connectivity of outerplanar graphs
• scientific article; zbMATH DE number 4041954
• Acyclic Edge Colouring of Outerplanar Graphs
• scientific article; zbMATH DE number 4008413
• Improved bounds for acyclic chromatic index of planar graphs

This page was built for publication: Acyclic reducible bounds for outerplanar graphs

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