On a weighted generalization of α-critical graphs

DOI10.1016/j.endm.2005.06.069zbMath1200.05095OpenAlexW2058470345MaRDI QIDQ3439372

Jean-Paul Doignon, Samuel Fiorini, Gwenaël Joret

Publication date: 29 May 2007

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

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

zbMATH Keywords

linear ordering polytope\(\alpha\) -critical graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Signed and weighted graphs (05C22)

Cites Work

• Unnamed Item
• Critical facets of the stable set polytope
• Matching theory
• Facets with fixed defect of the stable set polytope
• Random utility representation of binary choice probabilities: Critical graphs yielding critical necessary conditions
• Facets of the linear ordering polytope: a unification for the fence family through weighted graphs
• A Theorem on k-Saturated Graphs

This page was built for publication: On a weighted generalization of α-critical graphs