Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Curtis A. Barefoot
@article{DBLP:journals/dm/Barefoot02, author = {Curtis A. Barefoot}, title = {Block-cutvertex trees and block-cutvertex partitions}, journal = {Discret. Math.}, volume = {256}, number = {1-2}, pages = {35--54}, year = {2002}, url = {https://doi.org/10.1016/S0012-365X(01)00461-7}, doi = {10.1016/S0012-365X(01)00461-7}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Barefoot02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/BarefootES97, author = {Curtis A. Barefoot and Roger C. Entringer and L{\'{a}}szl{\'{o}} A. Sz{\'{e}}kely}, title = {Extremal Values for Ratios of Distances in Trees}, journal = {Discret. Appl. Math.}, volume = {80}, number = {1}, pages = {37--56}, year = {1997}, url = {https://doi.org/10.1016/S0166-218X(97)00068-1}, doi = {10.1016/S0166-218X(97)00068-1}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/BarefootES97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/BarefootCEPST96, author = {Curtis A. Barefoot and Lane H. Clark and Roger C. Entringer and T. D. Porter and L{\'{a}}szl{\'{o}} A. Sz{\'{e}}kely and Zsolt Tuza}, title = {Cycle-saturated graphs of minimum size}, journal = {Discret. Math.}, volume = {150}, number = {1-3}, pages = {31--48}, year = {1996}, url = {https://doi.org/10.1016/0012-365X(95)00173-T}, doi = {10.1016/0012-365X(95)00173-T}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/BarefootCEPST96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/BarefootCDES94, author = {Curtis A. Barefoot and Lane H. Clark and A. J. Depew and Roger C. Entringer and L{\'{a}}szl{\'{o}} A. Sz{\'{e}}kely}, title = {Subdivision thresholds for two classes of graphs}, journal = {Discret. Math.}, volume = {125}, number = {1-3}, pages = {15--30}, year = {1994}, url = {https://doi.org/10.1016/0012-365X(94)90140-6}, doi = {10.1016/0012-365X(94)90140-6}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/BarefootCDES94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Barefoot84, author = {Curtis A. Barefoot}, title = {Interpolation theorem for the number of pendant vertices of connected spanning subgraphs of equal size}, journal = {Discret. Math.}, volume = {49}, number = {2}, pages = {109--112}, year = {1984}, url = {https://doi.org/10.1016/0012-365X(84)90061-X}, doi = {10.1016/0012-365X(84)90061-X}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Barefoot84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/BarefootE81, author = {Curtis A. Barefoot and Roger C. Entringer}, title = {A census of maximum uniquely hamiltonian graphs}, journal = {J. Graph Theory}, volume = {5}, number = {3}, pages = {315--321}, year = {1981}, url = {https://doi.org/10.1002/jgt.3190050313}, doi = {10.1002/JGT.3190050313}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/BarefootE81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/BarefootE80, author = {Curtis A. Barefoot and Roger C. Entringer}, title = {Extremal maximal uniquely hamiltonian graphs}, journal = {J. Graph Theory}, volume = {4}, number = {1}, pages = {93--100}, year = {1980}, url = {https://doi.org/10.1002/jgt.3190040110}, doi = {10.1002/JGT.3190040110}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/BarefootE80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.