Characterizing and generalizing cycle completable graphs

DOI10.1016/j.disc.2023.113754arXiv2304.09335OpenAlexW4387806343MaRDI QIDQ6184532

Maria Chudnovsky, Ian M. J. McInnis

Publication date: 25 January 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2304.09335

zbMATH Keywords

forbidden induced subgraphs\(k\)-quasichordalcycle completable

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Matrix completion problems (15A83)

Cites Work

• On graphs with no induced subdivision of \(K_4\)
• Graph minors. III. Planar tree-width
• Structural conditions for cycle completable graphs
• S-functions for graphs
• Induced subgraphs and tree decompositions. I: Even-hole-free graphs of bounded degree
• Contribution to nonserial dynamic programming
• The Euclidean distance completion problem: cycle completability
• The real positive definite completion problem: cycle completability

This page was built for publication: Characterizing and generalizing cycle completable graphs