Totally odd subdivisions and parity subdivisions: Structures and Coloring
From MaRDI portal
Publication:5741781
DOI10.1137/1.9781611973105.73zbMath1423.05175OpenAlexW4239945732MaRDI QIDQ5741781
Publication date: 15 May 2019
Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/7f597aefcfa4ab366ec5c3c17e11e1fc0fd3563a
Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (2)
Subdivisions with congruence constraints in digraphs of large chromatic number ⋮ Tight bounds for divisible subdivisions
This page was built for publication: Totally odd subdivisions and parity subdivisions: Structures and Coloring