On computational aspects of cores of ordered graphs

DOI10.1007/978-3-032-22469-9_7MaRDI QIDQ7287076zbMATH OpenFDO

Authors Michal Čertík, Andreas Emil Feldmann, J. Nešetřil, Paweł Rzążewski

Publication date 23 June 2026

Full work available at URL https://doi.org/10.1007/978-3-032-22469-9_7

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Chromatic number of ordered graphs with forbidden ordered subgraphs
• Extremal theory of vertex or edge ordered graphs
• Forbidden paths and cycles in ordered graphs and matrices
• scientific article; zbMATH DE number 3827200 (Why is no real title available?)
• scientific article; zbMATH DE number 2117181 (Why is no real title available?)
• scientific article; zbMATH DE number 863494 (Why is no real title available?)
• scientific article; zbMATH DE number 3293585 (Why is no real title available?)
• Title not available (Why is no real title available?)
• Multi-linear forms, graphs, and \(L^p\)-improving measures in \(\mathbb{F}_q^d\)
• On the Complexity of Timetable and Multicommodity Flow Problems
• Reconstruction in one dimension from unlabeled euclidean lengths
• Strong computational lower bounds via parameterized complexity
• The core of a graph
• Twin-width and permutations (extended abstract)
• Twin-width IV: ordered graphs and matrices

This page was built for publication: On computational aspects of cores of ordered graphs

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