A characterization of signed graphs with generalized perfect elimination orderings

DOI10.1016/j.disc.2009.09.019zbMath1209.05119arXiv0712.4118OpenAlexW2052051865MaRDI QIDQ965961

Koji Nuida

Publication date: 27 April 2010

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

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

zbMATH Keywords

characterizationchordal graphsigned graphhyperplane arrangementelimination ordering

Mathematics Subject Classification ID

Signed and weighted graphs (05C22)

Related Items (2)

Inequalities for free multi-braid arrangements ⋮ Freeness for restriction arrangements of the extended Shi and Catalan arrangements

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• How is a chordal graph like a supersolvable binary matroid?
• Free hyperplane arrangements between \(A_{n-1}\) and \(B_ n\)
• Chordally signed graphs
• Supersolvable frame-matroid and graphic-lift lattices
• Incidence matrices and interval graphs
• Triangulated graphs and the elimination process
• Supersolvable lattices
• The Geometry of Root Systems and Signed Graphs
• Signed-eliminable graphs and free multiplicities on the braid arrangement

This page was built for publication: A characterization of signed graphs with generalized perfect elimination orderings