Graph cores via universal completability

DOI10.1016/J.ENDM.2015.06.046MaRDI QIDQ322258zbMATH OpenOpenAlexFDO

Authors Brendan Rooney, Robert Šámal, A. Varvitsiotis, David Roberson, Chris Godsil

Publication date 14 October 2016

Full work available at URL https://doi.org/10.1016/j.endm.2015.06.046

zbMATH Keywords

graph coresuniversal completabilityuniversal rigidity

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Graph minors (05C83)

Recommendations

• Completeness-resolvable graphs
• Graph universal cycles: compression and connections to universal cycles
• Universal elements and the complexity of certain classes of infinite graphs
• Universal graphs and induced-universal graphs
• Existence and nonexistence of universal graphs
• Universal and unavoidable graphs
• scientific article; zbMATH DE number 434696
• The universality of Hom complexes of graphs
• Cores and compactness of infinite directed graphs
• Some remarks on universal graphs

Cites work

• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• A new graph parameter related to bounded rank positive semidefinite matrix completions
• Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope
• Homomorphisms of derivative graphs
• Positive semidefinite matrix completion, universal rigidity and the strong Arnold property

Cited in

(3)

• Cores of geometric graphs
• The core of a complementary prism
• Universal completability, least eigenvalue frameworks, and vector colorings

This page was built for publication: Graph cores via universal completability

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