Clustered coloring of graphs with bounded layered treewidth and bounded degree
From MaRDI portal
Publication:6612290
DOI10.1016/J.EJC.2023.103730zbMATH Open1548.0513MaRDI QIDQ6612290
Publication date: 30 September 2024
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15)
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?)
- A relaxed Hadwiger's conjecture for list colorings
- String graphs. II: Recognizing string graphs is NP-hard
- A partial k-arboretum of graphs with bounded treewidth
- Bounded size components -- partitions and transversals.
- Partitioning into graphs with only small components
- Defective and clustered graph colouring
- Recognizing string graphs is decidable
- Decidability of string graphs
- Immersion and clustered coloring
- Clustered colouring in minor-closed classes
- Layered separators in minor-closed graph classes with applications
- Approximation algorithms for independent sets in map graphs
- Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs
- Parameters Tied to Treewidth
- A Separator Theorem for String Graphs and its Applications
- Map graphs
- Graph coloring with no large monochromatic components
- New bounds on the edge number of ak-map graph
- A Weakening of the Odd Hadwiger's Conjecture
- The Game of Hex and the Brouwer Fixed-Point Theorem
- Improper colourings inspired by Hadwiger's conjecture
- Colourings with Bounded Monochromatic Components in Graphs of Given Circumference
- Orthogonal Tree Decompositions of Graphs
- Improper colouring of graphs with no odd clique minor
- Defective and clustered choosability of sparse graphs
- Structure of Graphs with Locally Restricted Crossings
- Improper coloring of graphs on surfaces
- Applications of a New Separator Theorem for String Graphs
- Colouring Planar Graphs With Three Colours and No Large Monochromatic Components
- Islands in Graphs on Surfaces
- Clustered 3-colouring graphs of bounded degree
- Partitioning \(H\)-minor free graphs into three subgraphs with no large components
- Recognizing string graphs in NP
- Asymptotic dimension of minor-closed families and Assouad-Nagata dimension of surfaces
Related Items (1)
This page was built for publication: Clustered coloring of graphs with bounded layered treewidth and bounded degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6612290)
