Partitioning \(H\)-free graphs of bounded diameter
From MaRDI portal
Publication:2166756
DOI10.1016/j.tcs.2022.07.009OpenAlexW3163870220MaRDI QIDQ2166756
Daniël Paulusma, Siani Smith, Christoph Brause, Barnaby Martin, Petr A. Golovach
Publication date: 25 August 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.04588
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms and almost tight results for 3-colorability of small diameter graphs
- The complexity of surjective homomorphism problems-a survey
- The structure of bull-free graphs II and III -- a summary
- The complexity of colouring problems on dense graphs
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
- Independent feedback vertex sets for graphs of bounded diameter
- Independent feedback vertex set for \(P_5\)-free graphs
- Vertex colouring and forbidden subgraphs -- a survey
- Three complexity results on coloring \(P_k\)-free graphs
- Injective colouring for H-free graphs
- On a simple hard variant of \textsc{Not-All-Equal} 3-\textsc{Sat}
- On line graphs of subcubic triangle-free graphs
- Open Problems on Graph Coloring for Special Graph Classes
- A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs
- Domination When the Stars Are Out
- Graph Classes: A Survey
- Polynomial algorithm for finding the largest independent sets in graphs without forks
- Colouring H-free graphs of bounded diameter.
- Clique-width for hereditary graph classes
- The complexity of satisfiability problems
- Colouring graphs of bounded diameter in the absence of small cycles
- Acyclic, star, and injective colouring: bounding the diameter
- Feedback Vertex Set and Even Cycle Transversal for H-free graphs: finding large block graphs
This page was built for publication: Partitioning \(H\)-free graphs of bounded diameter
