On the number of dissimilar pfaffian orientations of graphs
RAIRO-Theor. Inf. Appl., 39 1 (2005) 93-113
Published online: 2005-03-15
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Nice vertices in cubic graphs
Wuxian Chen, Fuliang Lu and Heping ZhangDiscrete Mathematics 348 (10) 114553 (2025)
https://doi.org/10.1016/j.disc.2025.114553
Removable and forced subgraphs of graphs
Wuxian Chen and Heping ZhangDiscrete Applied Mathematics 351 23 (2024)
https://doi.org/10.1016/j.dam.2024.03.004
An $$O(|E(G)|^2)$$ O ( | E ( G ) | 2 ) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs
Xing Feng, Lianzhu Zhang and Mingzu ZhangJournal of Combinatorial Optimization 35 (3) 740 (2018)
https://doi.org/10.1007/s10878-017-0207-0
A generalization of Littleʼs Theorem on Pfaffian orientations
Marcelo H. de Carvalho, Cláudio L. Lucchesi and U.S.R. MurtyJournal of Combinatorial Theory, Series B 102 (6) 1241 (2012)
https://doi.org/10.1016/j.jctb.2012.07.004
Recognizing near-bipartite Pfaffian graphs in polynomial time
Alberto Alexandre Assis Miranda and Cláudio Leonardo LucchesiDiscrete Applied Mathematics 158 (12) 1275 (2010)
https://doi.org/10.1016/j.dam.2009.01.008
A Polynomial Time Algorithm for Recognizing Near-Bipartite Pfaffian Graphs
Alberto Alexandre Assis Miranda and Cláudio Leonardo LucchesiElectronic Notes in Discrete Mathematics 30 171 (2008)
https://doi.org/10.1016/j.endm.2008.01.030