Abstract
AbstractWe present a construction called layered wheel. Layered wheels are graphs of arbitrarily large treewidth and girth. They might be an outcome for a possible theorem characterizing graphs with large treewidth in terms of their induced subgraphs (while such a characterization is well‐understood in terms of minors). They also provide examples of graphs of large treewidth and large rankwidth in well‐studied classes, such as (theta, triangle)‐free graphs and even‐hole‐free graphs with no (where a hole is a chordless cycle of length at least four, a theta is a graph made of three internally vertex disjoint paths of length at least two linking two vertices, and is the complete graph on four vertices).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
