Linear colorings of graphs

DOI10.1016/J.EJC.2026.104374MaRDI QIDQ7293103zbMATH OpenFDO

Authors Claire Hilaire, Matjaž Krnc, Martin Milanič, Jean-Florent Raymond

Publication date 9 July 2026

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJC.2026.104374

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Cites work

• A c^k n 5-approximation algorithm for treewidth
• A characterisation of rigid circuit graphs
• Forbidden graphs for tree-depth
• Grad and classes with bounded expansion. II: Algorithmic aspects
• Graph theory (to appear)
• scientific article; zbMATH DE number 3730183 (Why is no real title available?)
• scientific article; zbMATH DE number 1303600 (Why is no real title available?)
• Improved bounds for the excluded-minor approximation of treedepth
• Linearity of grid minors in treewidth with applications through bidimensionality
• Optimal node ranking of tree in linear time
• Ordered colourings
• Paw-free graphs
• Polynomial treedepth bounds in linear colorings
• Rankings of Graphs
• Representations of chordal graphs as subtrees of a tree
• Separators in region intersection graphs
• Sparsity. Graphs, structures, and algorithms
• Structural sparsity of complex networks: bounded expansion in random models and real-world graphs
• Testing first-order properties for subclasses of sparse graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs

This page was built for publication: Linear colorings of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7293103)