Automated testing and interactive construction of unavoidable sets for graph classes of small path‐width

DOI10.1002/jgt.22964zbMath1522.05463arXiv2010.08373OpenAlexW3093109028MaRDI QIDQ6094029

Oliver Bachtler, Irene Heinrich

Publication date: 9 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2010.08373

zbMATH Keywords

cubic graphgirthpath-widthunavoidable structure

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unavoidable induced subgraphs in large graphs with no homogeneous sets
• An introduction to the discharging method via graph coloring
• Treewidth computations. II. Lower bounds
• Graph minors. XX: Wagner's conjecture
• Girth and treewidth
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• A partial k-arboretum of graphs with bounded treewidth
• House of Graphs: a database of interesting graphs
• The complexity of first-order and monadic second-order logic revisited
• Knot diagrams of treewidth two
• Proof labeling schemes
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Graph Theory
• Recent developments in graph Ramsey theory
• Introduction to local certification
• Cycle decompositions of pathwidth‐6 graphs
• A variant of a recursively unsolvable problem

This page was built for publication: Automated testing and interactive construction of unavoidable sets for graph classes of small path‐width