A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Master index of volumes 81–90
1991
Discrete Mathematics
Preserved Fulltext
Bienstock, D., On the complexity of testing for odd holes and induced odd paths (Note) Blyth, T. and J. Varlet, Principal congruences on some lattice-ordered algebras (Note)
, 0 . 0 Favaron, H. ...
Tuza and W .T. 84 (1990) 221-239
84 (1990) 111-118
86 (1990)
27-31
89 (1991)
97-100
90 (1991)
85-92
81 (1990) 323-329
Bollobas, B., E.J. Cockayne and C.M. ...
doi:10.1016/0012-365x(91)90131-k
fatcat:gbxyeqcrdrcb7eqpruwbpkf2xy
Page 118 of Mathematical Reviews Vol. 24, Issue Index
[page]
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
(Hubert de Fraysseix) 92i:05081 05C10 (05C85)
— On the complexity of testing for odd holes and induced odd paths. Discrete Math. 90 (1991), no. 1, 85-92. (E.M. ...
Discrete Math. 4 (1991), no. 1, 17-27. (Ji Zhong) 92b:05014 05B20
— Corrigendum: “On the complexity of testing for odd holes and induced odd paths”. Discrete Math. 102 (1992), no. 1, 109. (E. M. ...
The (theta, wheel)-free graphs Part IV: induced paths and cycles
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper we use this decomposition theorem to solve several problems related to finding induced paths and cycles in our class. ...
On the complexity of testing for odd holes and induced odd paths.
Discrete Mathematics, 90:85–92, 1991. See also Corrigendum by B. Reed, Discrete
Mathematics, 102:109, 1992.
[3] H. ...
SIAM Journal of Discrete Mathematics, 29 (1): 348-375, 2015.
[14] P.A. Golovach, D. Paulusma, and E.J. van Leeuwen. Induced disjoint paths in circular-
arc graphs in linear time. Theor. Comput. ...
arXiv:1912.00516v1
fatcat:w366e4gnavejfhsyfg7kcyatae
A Mathematical Bibliography of Signed and Gain Graphs and Allied Areas
1996
unpublished
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
(SG: Phys, Fr, Alg)
Dan Bienstock
1991a On the complexity of testing for odd holes and induced odd paths. Discrete Math.
90 (1991), 85-92. MR 92m:68040a. Zbl. 753.05046. ...
Mat. 43, No. 3/4 (1991), 85-219. MR 92j:05114. Zbl. 751.05060. ...
Lovász, D. Miklós, and T. Szönyi, eds., Sets, Graphs and Numbers (Proc., Budapest, 1991), pp. 713-718. Colloq. Math. Soc. János Bolyai, Vol. 60. János Bolyai Math. ...
fatcat:dio2hl7pfbgx7bundw27ioychi
A Mathematical Bibliography of Signed and Gain Graphs and Allied Areas Compiled by
1996
unpublished
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
If you have any suggestions whatever for items to include in this bibliography, or for other changes, please let me hear from you. Thank you. ...
(SG: Phys, Fr, Alg) Dan Bienstock 1991a On the complexity of testing for odd holes and induced odd paths. Discrete Math. 90 (1991) , 85-92. MR 92m:68040a. Zbl 753. 05046. ...
Discrete Appl. Math. 20 (1988) , 83-85. MR 89d:05148. Zbl 647.05028. ...
fatcat:os5lveptfbbbplmcy4drb2zd3m