Small dense on-line arbitrarily partitionable graphs

DOI10.1016/J.AMC.2024.128582OpenAlexW4391503709WikidataQ128753890 ScholiaQ128753890MaRDI QIDQ6130139FDOQ6130139

Authors: Monika Bednarz, Agnieszka Burkot, Jakub Kwaśny, Kamil Pawłowski, Angelika Ryngier 

Publication date: 18 April 2024

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2024.128582

Recommendations

• Dense on-line arbitrarily partitionable graphs
• Dense arbitrarily partitionable graphs
• More aspects of arbitrarily partitionable graphs
• On the structure of arbitrarily partitionable graphs with given connectivity
• On minimal arbitrarily partitionable graphs

zbMATH Keywords

perfect matchingpartitions of graphstraceable graphs

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (2)

• Interplays between variations of arbitrarily partitionable graphs under minimality constraints
• Closure results for arbitrarily partitionable graphs

This page was built for publication: Small dense on-line arbitrarily partitionable graphs

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