Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Vance Faber
@article{DBLP:journals/corr/abs-2208-10537,
author = {Nyumbu Chishwashwa and
Vance Faber and
Noah Streib},
title = {Digraph Networks and Groupoids},
journal = {CoRR},
volume = {abs/2208.10537},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.10537},
doi = {10.48550/ARXIV.2208.10537},
eprinttype = {arXiv},
eprint = {2208.10537},
timestamp = {Mon, 29 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-10537.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2209-14579,
author = {Vance Faber and
J{\"{o}}rg Liesen and
Petr Tich{\'{y}}},
title = {On the Forsythe conjecture},
journal = {CoRR},
volume = {abs/2209.14579},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2209.14579},
doi = {10.48550/ARXIV.2209.14579},
eprinttype = {arXiv},
eprint = {2209.14579},
timestamp = {Thu, 06 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2209-14579.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BurkhardtFH20,
author = {Paul Burkhardt and
Vance Faber and
David G. Harris},
title = {Bounds and algorithms for graph trusses},
journal = {J. Graph Algorithms Appl.},
volume = {24},
number = {3},
pages = {191--214},
year = {2020},
url = {https://doi.org/10.7155/jgaa.00527},
doi = {10.7155/JGAA.00527},
timestamp = {Thu, 24 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BurkhardtFH20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FaberH19,
author = {Vance Faber and
David G. Harris},
title = {Edge-coloring linear hypergraphs with medium-sized edges},
journal = {Random Struct. Algorithms},
volume = {55},
number = {1},
pages = {153--159},
year = {2019},
url = {https://doi.org/10.1002/rsa.20843},
doi = {10.1002/RSA.20843},
timestamp = {Thu, 24 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/FaberH19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-05523,
author = {Paul Burkhardt and
Vance Faber and
David G. Harris},
title = {Bounds and algorithms for k-truss},
journal = {CoRR},
volume = {abs/1806.05523},
year = {2018},
url = {http://arxiv.org/abs/1806.05523},
eprinttype = {arXiv},
eprint = {1806.05523},
timestamp = {Thu, 24 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-05523.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Faber14,
author = {Vance Faber},
title = {Transpose on vertex symmetric digraphs},
journal = {CoRR},
volume = {abs/1407.0958},
year = {2014},
url = {http://arxiv.org/abs/1407.0958},
eprinttype = {arXiv},
eprint = {1407.0958},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Faber14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siammax/FaberLT13,
author = {Vance Faber and
J{\"{o}}rg Liesen and
Petr Tich{\'{y}}},
title = {Properties of Worst-Case {GMRES}},
journal = {{SIAM} J. Matrix Anal. Appl.},
volume = {34},
number = {4},
pages = {1500--1519},
year = {2013},
url = {https://doi.org/10.1137/13091066X},
doi = {10.1137/13091066X},
timestamp = {Tue, 26 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siammax/FaberLT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1305-6349,
author = {Vance Faber},
title = {Global communication algorithms for Cayley graphs},
journal = {CoRR},
volume = {abs/1305.6349},
year = {2013},
url = {http://arxiv.org/abs/1305.6349},
eprinttype = {arXiv},
eprint = {1305.6349},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1305-6349.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1201-4153,
author = {Vance Faber},
title = {Global sum on symmetric networks},
journal = {CoRR},
volume = {abs/1201.4153},
year = {2012},
url = {http://arxiv.org/abs/1201.4153},
eprinttype = {arXiv},
eprint = {1201.4153},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1201-4153.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1201-4524,
author = {Vance Faber},
title = {Livelock free routing schemes},
journal = {CoRR},
volume = {abs/1201.4524},
year = {2012},
url = {http://arxiv.org/abs/1201.4524},
eprinttype = {arXiv},
eprint = {1201.4524},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1201-4524.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/nn/HawrylyczNPMLFFSMLJ11,
author = {Michael Hawrylycz and
Lydia Ng and
Damon Page and
John Morris and
Christopher Lau and
Sky Faber and
Vance Faber and
Susan Sunkin and
Vilas Menon and
Ed S. Lein and
Allan Jones},
title = {Multi-scale correlation structure of gene expression in the brain},
journal = {Neural Networks},
volume = {24},
number = {9},
pages = {933--942},
year = {2011},
url = {https://doi.org/10.1016/j.neunet.2011.06.012},
doi = {10.1016/J.NEUNET.2011.06.012},
timestamp = {Mon, 08 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/nn/HawrylyczNPMLFFSMLJ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/Faber11,
author = {Vance Faber},
title = {Review of chromatic graph theory by Gary Chartrand and Ping Zhang},
journal = {{SIGACT} News},
volume = {42},
number = {3},
pages = {23--28},
year = {2011},
url = {https://doi.org/10.1145/2034575.2034580},
doi = {10.1145/2034575.2034580},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sigact/Faber11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siammax/FaberLT10,
author = {Vance Faber and
J{\"{o}}rg Liesen and
Petr Tich{\'{y}}},
title = {On Chebyshev Polynomials of Matrices},
journal = {{SIAM} J. Matrix Anal. Appl.},
volume = {31},
number = {4},
pages = {2205--2221},
year = {2010},
url = {https://doi.org/10.1137/090779486},
doi = {10.1137/090779486},
timestamp = {Tue, 26 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siammax/FaberLT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/FaberLT09,
author = {Vance Faber and
J{\"{o}}rg Liesen and
Petr Tich{\'{y}}},
title = {On orthogonal reduction to Hessenberg form with small bandwidth},
journal = {Numer. Algorithms},
volume = {51},
number = {2},
pages = {133--142},
year = {2009},
url = {https://doi.org/10.1007/s11075-008-9242-3},
doi = {10.1007/S11075-008-9242-3},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/FaberLT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamnum/FaberLT08,
author = {Vance Faber and
J{\"{o}}rg Liesen and
Petr Tich{\'{y}}},
title = {The Faber-Manteuffel Theorem for Linear Operators},
journal = {{SIAM} J. Numer. Anal.},
volume = {46},
number = {3},
pages = {1323--1337},
year = {2008},
url = {https://doi.org/10.1137/060678087},
doi = {10.1137/060678087},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamnum/FaberLT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/DoughertyFM04,
author = {Randall Dougherty and
Vance Faber and
Michael Murphy},
title = {Unflippable Tetrahedral Complexes},
journal = {Discret. Comput. Geom.},
volume = {32},
number = {3},
pages = {309--315},
year = {2004},
url = {https://doi.org/10.1007/s00454-004-1097-3},
doi = {10.1007/S00454-004-1097-3},
timestamp = {Thu, 27 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/DoughertyFM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DoughertyF04,
author = {Randall Dougherty and
Vance Faber},
title = {The Degree-Diameter Problem for Several Varieties of Cayley Graphs
{I:} The Abelian Case},
journal = {{SIAM} J. Discret. Math.},
volume = {17},
number = {3},
pages = {478--519},
year = {2004},
url = {https://doi.org/10.1137/S0895480100372899},
doi = {10.1137/S0895480100372899},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/DoughertyF04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BarrettMMCHFSST03,
author = {Christopher L. Barrett and
Achla Marathe and
Madhav V. Marathe and
Doug Cook and
Gregory Hicks and
Vance Faber and
Aravind Srinivasan and
Yoram J. Sussmann and
Heidi Thornquist},
title = {Statistical Analysis of Algorithms: {A} Case Study of Market-Clearing
Mechanisms in the Power Industry},
journal = {J. Graph Algorithms Appl.},
volume = {7},
number = {1},
pages = {3--31},
year = {2003},
url = {https://doi.org/10.7155/jgaa.00059},
doi = {10.7155/JGAA.00059},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BarrettMMCHFSST03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdar/MikheevVF01,
author = {Artem Mikheev and
Luc Vincent and
Vance Faber},
title = {High-Quality Polygonal Contour Approximation Based on Relaxation},
booktitle = {6th International Conference on Document Analysis and Recognition
{(ICDAR} 2001), 10-13 September 2001, Seattle, WA, {USA}},
pages = {361--367},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/ICDAR.2001.953814},
doi = {10.1109/ICDAR.2001.953814},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icdar/MikheevVF01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wae/BarrettCHFMMSST01,
author = {Christopher L. Barrett and
Doug Cook and
Gregory Hicks and
Vance Faber and
Achla Marathe and
Madhav V. Marathe and
Aravind Srinivasan and
Yoram J. Sussmann and
Heidi Thornquist},
editor = {Gerth St{\o}lting Brodal and
Daniele Frigioni and
Alberto Marchetti{-}Spaccamela},
title = {Experimental Analysis of Algorithms for Bilateral-Contract Clearing
Mechanisms Arising in Deregulated Power Industry},
booktitle = {Algorithm Engineering, 5th International Workshop, {WAE} 2001 Aarhus,
Denmark, August 28-31, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2141},
pages = {172--184},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44688-5\_14},
doi = {10.1007/3-540-44688-5\_14},
timestamp = {Fri, 07 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wae/BarrettCHFMMSST01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamrev/DuFG99,
author = {Qiang Du and
Vance Faber and
Max D. Gunzburger},
title = {Centroidal Voronoi Tessellations: Applications and Algorithms},
journal = {{SIAM} Rev.},
volume = {41},
number = {4},
pages = {637--676},
year = {1999},
url = {https://doi.org/10.1137/S0036144599352836},
doi = {10.1137/S0036144599352836},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamrev/DuFG99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/CookFMSS98,
author = {Doug Cook and
Vance Faber and
Madhav V. Marathe and
Aravind Srinivasan and
Yoram J. Sussmann},
editor = {Kim Guldstrand Larsen and
Sven Skyum and
Glynn Winskel},
title = {Low-Bandwidth Routing and Electrical Power Networks},
booktitle = {Automata, Languages and Programming, 25th International Colloquium,
ICALP'98, Aalborg, Denmark, July 13-17, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1443},
pages = {604--615},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0055088},
doi = {10.1007/BFB0055088},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/CookFMSS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siammax/FaberJKM96,
author = {Vance Faber and
Wayne Joubert and
Emanuel Knill and
Thomas A. Manteuffel},
title = {Minimal Residual Method Stronger than Polynomial Preconditioning},
journal = {{SIAM} J. Matrix Anal. Appl.},
volume = {17},
number = {4},
pages = {707--729},
year = {1996},
url = {https://doi.org/10.1137/S0895479895286748},
doi = {10.1137/S0895479895286748},
timestamp = {Sat, 30 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siammax/FaberJKM96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BrewsterDF95,
author = {Tony L. Brewster and
Michael J. Dinneen and
Vance Faber},
title = {A computational attack on the conjectures of Graffiti: New counterexamples
and proofs},
journal = {Discret. Math.},
volume = {147},
number = {1-3},
pages = {35--55},
year = {1995},
url = {https://doi.org/10.1016/0012-365X(94)00227-A},
doi = {10.1016/0012-365X(94)00227-A},
timestamp = {Sat, 21 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/BrewsterDF95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jpdc/DraperF95,
author = {Richard N. Draper and
Vance Faber},
title = {The Diameter and Average Distance of Supertoroidal Networks},
journal = {J. Parallel Distributed Comput.},
volume = {31},
number = {1},
pages = {1--13},
year = {1995},
url = {https://doi.org/10.1006/jpdc.1995.1140},
doi = {10.1006/JPDC.1995.1140},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jpdc/DraperF95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tsp/BradleyF95,
author = {Jonathan N. Bradley and
Vance Faber},
title = {Perfect reconstruction with critically sampled filter banks and linear
boundary conditions},
journal = {{IEEE} Trans. Signal Process.},
volume = {43},
number = {4},
pages = {994--997},
year = {1995},
url = {https://doi.org/10.1109/78.376853},
doi = {10.1109/78.376853},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tsp/BradleyF95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ChungFM94,
author = {Fan R. K. Chung and
Vance Faber and
Thomas A. Manteuffel},
title = {An Upper Bound on the Diameter of a Graph from Eigenvalues Associated
with its Laplacian},
journal = {{SIAM} J. Discret. Math.},
volume = {7},
number = {3},
pages = {443--457},
year = {1994},
url = {https://doi.org/10.1137/S0895480191217776},
doi = {10.1137/S0895480191217776},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ChungFM94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/ChenFK94,
author = {William Y. C. Chen and
Vance Faber and
Emanuel Knill},
editor = {D. Frank Hsu and
Arnold L. Rosenberg and
Dominique Sotteau},
title = {Restricted routing and wide diameter of the cycle prefix network},
booktitle = {Workshop on Interconnection Networks and Mapping and Scheduling Parallel
Computations, Proceedings of a {DIMACS} Workshop, Piscataway, New
Jersey, USA, February 7-9, 1994},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {21},
pages = {31--46},
publisher = {{DIMACS/AMS}},
year = {1994},
url = {https://doi.org/10.1090/dimacs/021/04},
doi = {10.1090/DIMACS/021/04},
timestamp = {Mon, 22 May 2023 16:07:35 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/ChenFK94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/FaberMC93,
author = {Vance Faber and
James W. Moore and
William Y. C. Chen},
title = {Cycle prefix digraphs for symmetric interconnection networks},
journal = {Networks},
volume = {23},
number = {7},
pages = {641--649},
year = {1993},
url = {https://doi.org/10.1002/net.3230230707},
doi = {10.1002/NET.3230230707},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/FaberMC93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tc/CampbellCDFFLMMS92,
author = {Lowell Campbell and
Gunnar E. Carlsson and
Michael J. Dinneen and
Vance Faber and
Michael R. Fellows and
Michael A. Langston and
James W. Moore and
Andrew P. Mullhaupt and
Harlan B. Sexton},
title = {Small Diameter Symmetric Networks from Linear Groups},
journal = {{IEEE} Trans. Computers},
volume = {41},
number = {2},
pages = {218--220},
year = {1992},
url = {https://doi.org/10.1109/12.123397},
doi = {10.1109/12.123397},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tc/CampbellCDFFLMMS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaecc/DinneenFF91,
author = {Michael J. Dinneen and
Michael R. Fellows and
Vance Faber},
editor = {Harold F. Mattson and
Teo Mora and
T. R. N. Rao},
title = {Algebraic Constructions of Efficient Broadcast Networks},
booktitle = {Applied Algebra, Algebraic Algorithms and Error-Correcting Codes,
9th International Symposium, AAECC-9, New Orleans, LA, USA, October
7-11, 1991, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {539},
pages = {152--158},
publisher = {Springer},
year = {1991},
url = {https://doi.org/10.1007/3-540-54522-0\_104},
doi = {10.1007/3-540-54522-0\_104},
timestamp = {Fri, 17 Jul 2020 16:12:48 +0200},
biburl = {https://dblp.org/rec/conf/aaecc/DinneenFF91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pc/LubeckF88,
author = {Olaf M. Lubeck and
Vance Faber},
title = {Modeling the performance of hypercubes: a case study using the particle-in-cell
application},
journal = {Parallel Comput.},
volume = {9},
number = {1},
pages = {37--52},
year = {1988},
url = {https://doi.org/10.1016/0167-8191(88)90017-8},
doi = {10.1016/0167-8191(88)90017-8},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/pc/LubeckF88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pc/FaberLW87,
author = {Vance Faber and
Olaf M. Lubeck and
Andrew B. White Jr.},
title = {Comments on the paper "parallel efficiency can be greater than
unity"},
journal = {Parallel Comput.},
volume = {4},
number = {2},
pages = {209--210},
year = {1987},
url = {https://doi.org/10.1016/0167-8191(87)90052-4},
doi = {10.1016/0167-8191(87)90052-4},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/pc/FaberLW87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ppsc/Faber87,
author = {Vance Faber},
editor = {Garry H. Rodrigue},
title = {Graph Theory Plus Group Theory Equals Answers to Communication Problems-Invited
Talk},
booktitle = {Proceedings of the Third {SIAM} Conference on Parallel Processing
for Scientific Computing, Los Angeles, California, USA, December 1-4,
1987},
pages = {412},
publisher = {{SIAM}},
year = {1987},
timestamp = {Mon, 24 Jun 2002 15:51:16 +0200},
biburl = {https://dblp.org/rec/conf/ppsc/Faber87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pc/FaberLW86,
author = {Vance Faber and
Olaf M. Lubeck and
Andrew B. White Jr.},
title = {Superlinear speedup of an efficient sequential algorithm is not possible},
journal = {Parallel Comput.},
volume = {3},
number = {3},
pages = {259--260},
year = {1986},
url = {https://doi.org/10.1016/0167-8191(86)90024-4},
doi = {10.1016/0167-8191(86)90024-4},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/pc/FaberLW86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/EhrenfeuchtFK84,
author = {Andrzej Ehrenfeucht and
Vance Faber and
Hal A. Kierstead},
title = {A new method of proving theorems on chromatic index},
journal = {Discret. Math.},
volume = {52},
number = {2-3},
pages = {159--164},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90078-5},
doi = {10.1016/0012-365X(84)90078-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/EhrenfeuchtFK84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/GoldsmithMF80,
author = {Donald L. Goldsmith and
Bennet Manvel and
Vance Faber},
title = {Separation of graphs into three components by the removal of edges},
journal = {J. Graph Theory},
volume = {4},
number = {2},
pages = {213--218},
year = {1980},
url = {https://doi.org/10.1002/jgt.3190040209},
doi = {10.1002/JGT.3190040209},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/GoldsmithMF80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/BermondF76,
author = {Jean{-}Claude Bermond and
Vance Faber},
title = {Decomposition of the complete directed graph into k-circuits},
journal = {J. Comb. Theory, Ser. {B}},
volume = {21},
number = {2},
pages = {146--155},
year = {1976},
url = {https://doi.org/10.1016/0095-8956(76)90055-1},
doi = {10.1016/0095-8956(76)90055-1},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/BermondF76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FaberM73,
author = {Vance Faber and
Jan Mycielski},
title = {Graphs with valency k, edge connectivity k, chromatic index k + 1
and arbitrary girth},
journal = {Discret. Math.},
volume = {4},
number = {4},
pages = {339--345},
year = {1973},
url = {https://doi.org/10.1016/0012-365X(73)90168-4},
doi = {10.1016/0012-365X(73)90168-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FaberM73.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-09 20:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
