Packing Arc-disjoint 4-cycles in oriented graphs

DOI10.4230/LIPICS.FSTTCS.2022.5MaRDI QIDQ6604606zbMATH OpenFDO

Authors Jasine Babu, R. Krithika, Deepak Rajendraprasad

Publication date 12 September 2024

Full work available at URL https://doi.org/10.4230/LIPICS.FSTTCS.2022.5

zbMATH Keywords

arc-disjoint cyclesbipartite digraphsoriented graphsparameterized complexity

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Cited in

(1)

• A polynomial kernel for deletion to the scattered class of cliques and trees

This page was built for publication: Packing Arc-disjoint 4-cycles in oriented graphs

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