Characterization of the maximum genus of a signed graph
- 作者Jozef Širáň; Martin Škoviera
- 卷第52卷
- 期第1期
- 印刷ISSN0095-8956
- 电子ISSN1096-0902
- 文件大小1859.98KB
- 发表时间1991
- DOI10.1016/0095-8956(91)90099-6
- 页码124-146
同标题推荐
同作者推荐
On more variants of the Majority ProblemAnglès d’Auriac, Paul-Elliot; Maisonneuve, Francis; Maisonneuve, Vivien; Preissmann, Emmanuel; Preissmann, Myriam · Discrete Applied Mathematics · 2019
Snarks of order 18Myriam Preissmann · 1982
Sequential colorings and perfect graphsFrédéric Maffray; Myriam Preissmann · 1999
Linear recognition of pseudo-split graphsFrédéric Maffray; Myriam Preissmann · 1994
Imperfect and Nonideal Clutters: A Common ApproachGrigor Gasparyan*; Myriam Preissmann; András Sebő · Combinatorica · 2003
Graphs with largest number of minimum cutsJenő Lehel; Frédéric Maffray; Myriam Preissmann · 1996
Characterizing path graphs by forbidden induced subgraphsBenjamin Lévêque; Frédéric Maffray; Myriam Preissmann · 2009