Hierarchical and modularly-minimal vertex colorings
From MaRDI portal
Publication:5058209
DOI10.26493/2590-9770.1422.9b6zbMath1502.05074arXiv2004.06340OpenAlexW4214657493MaRDI QIDQ5058209
Manuela Geiß, Peter F. Stadler, Dulce I. Valdivia, Marc Hellmuth, Maribel Hernandez-Rosales
Publication date: 19 December 2022
Published in: The Art of Discrete and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.06340
modular decompositionGrundy number\(P_4\)-sparse graphscographchromatics numberpropert vertex coloring
Trees (05C05) Taxonomy, cladistics, statistics in mathematical biology (92B10) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Unnamed Item
- A survey of the algorithmic aspects of modular decomposition
- Acyclic and star colorings of cographs
- On algorithms for (\(P_5\), gem)-free graphs
- Results on the Grundy chromatic number of graphs
- Some perfect coloring properties of graphs
- Complement reducible graphs
- A tree representation for \(P_ 4\)-sparse graphs
- Recovering symbolically dated, rooted trees from symbolic ultrametrics
- Modular decomposition and transitive orientation
- On extended \(P_4\)-reducible and extended \(P_4\)-sparse graphs
- Recursively constructible families of graphs
- Linear-time modular decomposition of directed graphs
- Vertex colouring and forbidden subgraphs -- a survey
- Linear time optimization algorithms for \(P_ 4\)-sparse graphs
- Orthology relations, symbolic ultrametrics, and cographs
- Reciprocal best match graphs
- BOUNDED SEARCH TREE ALGORITHMS FOR PARAMETRIZED COGRAPH DELETION: EFFICIENT BRANCHING RULES BY EXPLOITING STRUCTURES OF SPECIAL GRAPH CLASSES
- A Guide to Graph Colouring
- Computing Graph Polynomials on Graphs of Bounded Clique-Width
- Recursive Graphs, Recursive Labelings and Shortest Paths
- Nonrecursive traversals of trees
- Reservoir-sampling algorithms of time complexity O ( n (1 + log( N / n )))
- Reducibility among Combinatorial Problems
- Transitiv orientierbare Graphen
