Дисертації з теми "Graph theory"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 дисертацій для дослідження на тему "Graph theory".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
Bessy, Stéphane. "Some problems in graph theory and graphs algorithmic theory." Habilitation à diriger des recherches, Université Montpellier II - Sciences et Techniques du Languedoc, 2012. http://tel.archives-ouvertes.fr/tel-00806716.
Повний текст джерелаMyers, Joseph Samuel. "Extremal theory of graph minors and directed graphs." Thesis, University of Cambridge, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.619614.
Повний текст джерелаJohnson, Chase R. "Molecular Graph Theory." Digital WPI, 2010. https://digitalcommons.wpi.edu/etd-theses/1179.
Повний текст джерелаFeghali, Carl. "Topics in graph colouring and extremal graph theory." Thesis, Durham University, 2016. http://etheses.dur.ac.uk/11790/.
Повний текст джерелаNikwigize, Adolphe. "Graph theory : Route problems." Thesis, Linnéuniversitetet, Institutionen för datavetenskap, fysik och matematik, DFM, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-17397.
Повний текст джерелаBerg, Deborah. "Connections Between Voting Theory and Graph Theory." Scholarship @ Claremont, 2005. https://scholarship.claremont.edu/hmc_theses/178.
Повний текст джерелаHatt, Justin Dale. "Online assessment of graph theory." Thesis, Brunel University, 2016. http://bura.brunel.ac.uk/handle/2438/13389.
Повний текст джерелаKeevash, Peter. "Topics in extremal graph theory." Thesis, University of Cambridge, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.619938.
Повний текст джерелаLaw, Ka-ho, and 羅家豪. "Some results in graph theory." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2010. http://hub.hku.hk/bib/B44899816.
Повний текст джерелаMorrison, Julie Lindsay. "Computational graph theory in bioinformatics." Thesis, University of Strathclyde, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.435114.
Повний текст джерелаRicher, Duncan Christopher. "Graph theory and combinatorial games." Thesis, University of Cambridge, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.621916.
Повний текст джерелаEggemann, Nicole. "Some applications of graph theory." Thesis, Brunel University, 2009. http://bura.brunel.ac.uk/handle/2438/3953.
Повний текст джерелаNieh, Ari. "Fractional Analogues in Graph Theory." Scholarship @ Claremont, 2001. https://scholarship.claremont.edu/hmc_theses/131.
Повний текст джерелаLetzter, Shoham. "Extremal graph theory with emphasis on Ramsey theory." Thesis, University of Cambridge, 2015. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.709415.
Повний текст джерелаReed, Bruce. "A semi-strong perfect graph theorem /." Thesis, McGill University, 1986. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=72812.
Повний текст джерелаMeek, Darrin Leigh. "On graph approximation heuristics : an application to vertex cover on planar graphs." Thesis, Georgia Institute of Technology, 1991. http://hdl.handle.net/1853/24088.
Повний текст джерелаZuffi, Lorenzo. "Simplicial Complexes From Graphs Toward Graph Persistence." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2017. http://amslaurea.unibo.it/13519/.
Повний текст джерелаAnderson, Jon K. "Genetic algorithms applied to graph theory." Virtual Press, 1999. http://liblink.bsu.edu/uhtbin/catkey/1136714.
Повний текст джерелаDepartment of Computer Science
Peng, Richard. "Algorithm Design Using Spectral Graph Theory." Research Showcase @ CMU, 2013. http://repository.cmu.edu/dissertations/277.
Повний текст джерелаIslam, Mustafa R. "A hypertext graph theory reference system." Virtual Press, 1993. http://liblink.bsu.edu/uhtbin/catkey/879844.
Повний текст джерелаDepartment of Computer Science
Edwards, C. S. "Some extremal problems in graph theory." Thesis, University of Reading, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.373467.
Повний текст джерелаGarbe, Frederik. "Extremal graph theory via structural analysis." Thesis, University of Birmingham, 2018. http://etheses.bham.ac.uk//id/eprint/8869/.
Повний текст джерелаGrinshpun, Andrey Vadim. "Some problems in Graph Ramsey Theory." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/97767.
Повний текст джерелаThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 149-156).
A graph G is r-Ramsey minimal with respect to a graph H if every r-coloring of the edges of G yields a monochromatic copy of H, but the same is not true for any proper subgraph of G. The study of the properties of graphs that are Ramsey minimal with respect to some H and similar problems is known as graph Ramsey theory; we study several problems in this area. Burr, Erdös, and Lovász introduced s(H), the minimum over all G that are 2- Ramsey minimal for H of [delta](G), the minimum degree of G. We find the values of s(H) for several classes of graphs H, most notably for all 3-connected bipartite graphs which proves many cases of a conjecture due to Szabó, Zumstein, and Zürcher. One natural question when studying graph Ramsey theory is what happens when, rather than considering all 2-colorings of a graph G, we restrict to a subset of the possible 2-colorings. Erdös and Hajnal conjectured that, for any fixed color pattern C, there is some [epsilon] > 0 so that every 2-coloring of the edges of a Kn, the complete graph on n vertices, which doesn't contain a copy of C contains a monochromatic clique on n[epsilon] vertices. Hajnal generalized this conjecture to more than 2 colors and asked in particular about the case when the number of colors is 3 and C is a rainbow triangle (a K3 where each edge is a different color); we prove Hajnal's conjecture for rainbow triangles. One may also wonder what would happen if we wish to cover all of the vertices with monochromatic copies of graphs. Let F = {F₁, F₂, . . .} be a sequence of graphs such that Fn is a graph on n vertices with maximum degree at most [delta]. If each Fn is bipartite, then the vertices of any 2-edge-colored complete graph can be partitioned into at most 2C[delta] vertex disjoint monochromatic copies of graphs from F, where C is an absolute constant. This result is best possible, up to the constant C.
by Andrey Vadim Grinshpun.
Ph. D.
Pappone, Francesco. "Graph neural networks: theory and applications." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2021. http://amslaurea.unibo.it/23893/.
Повний текст джерелаParks, David J. "Graph theory in America, 1876-1950." Thesis, Open University, 2012. http://oro.open.ac.uk/54663/.
Повний текст джерелаSchuerger, Houston S. "Contributions to Geometry and Graph Theory." Thesis, University of North Texas, 2020. https://digital.library.unt.edu/ark:/67531/metadc1707341/.
Повний текст джерелаWeaver, Robert Wooddell. "Some problems in structural graph theory /." The Ohio State University, 1986. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487268021746449.
Повний текст джерелаFlorkowski, Stanley F. "Spectral graph theory of the Hypercube." Thesis, Monterey, Calif. : Naval Postgraduate School, 2008. http://edocs.nps.edu/npspubs/scholarly/theses/2008/Dec/08Dec%5FFlorkowski.pdf.
Повний текст джерелаThesis Advisor(s): Rasmussen, Craig W. "December 2008." Description based on title screen as viewed on January 29, 2009. Includes bibliographical references (p. 51-52). Also available in print.
Han, Lin. "Graph generative models from information theory." Thesis, University of York, 2012. http://etheses.whiterose.ac.uk/3726/.
Повний текст джерелаRobinson, Laura Ann. "Graph Theory for the Middle School." Digital Commons @ East Tennessee State University, 2006. https://dc.etsu.edu/etd/2226.
Повний текст джерелаLoveland, Susan M. "The Reconstruction Conjecture in Graph Theory." DigitalCommons@USU, 1985. https://digitalcommons.usu.edu/etd/7022.
Повний текст джерелаYi, Peipei. "Graph query autocompletion." HKBU Institutional Repository, 2018. https://repository.hkbu.edu.hk/etd_oa/557.
Повний текст джерелаLopez, Christian P. "On the relationship between a graph and the cycle graph of its complement." Thesis, Edith Cowan University, Research Online, Perth, Western Australia, 1995. https://ro.ecu.edu.au/theses/1184.
Повний текст джерелаHegde, Rajneesh. "New Tools and Results in Graph Structure Theory." Diss., Georgia Institute of Technology, 2006. http://hdl.handle.net/1853/10481.
Повний текст джерелаMorisi, Rita. "Graph–based techniques and spectral graph theory in control and machine learning." Thesis, IMT Alti Studi Lucca, 2016. http://e-theses.imtlucca.it/188/1/Morisi_phdthesis.pdf.
Повний текст джерелаHoang, Chinh T. "Perfect graphs." Thesis, McGill University, 1985. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=74011.
Повний текст джерелаHayward, Ryan B. "Two classes of perfect graphs." Thesis, McGill University, 1986. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=74025.
Повний текст джерелаOlariu, Stephan. "Results on perfect graphs." Thesis, McGill University, 1986. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=73997.
Повний текст джерелаWeinstein, Lee. "Empirical study of graph properties with particular interest towards random graphs." Diss., Connect to the thesis, 2005. http://hdl.handle.net/10066/1485.
Повний текст джерелаWaterhouse, Mary Alexandra Paula Royston Hastilow. "Coloured graph decompositions /." [St. Lucia, Qld.], 2005. http://www.library.uq.edu.au/pdfserve.php?image=thesisabs/absthe18769.pdf.
Повний текст джерелаNarayanan, Bhargav. "Problems in Ramsey theory, probabilistic combinatorics and extremal graph theory." Thesis, University of Cambridge, 2015. https://www.repository.cam.ac.uk/handle/1810/252850.
Повний текст джерелаFiala, Nick C. "Some topics in combinatorial design theory and algebraic graph theory /." The Ohio State University, 2002. http://rave.ohiolink.edu/etdc/view?acc_num=osu1486402957198077.
Повний текст джерелаBurns, Jonathan. "Recursive Methods in Number Theory, Combinatorial Graph Theory, and Probability." Scholar Commons, 2014. https://scholarcommons.usf.edu/etd/5193.
Повний текст джерелаTurner, Bethany. "Embeddings of Product Graphs Where One Factor is a Hypercube." VCU Scholars Compass, 2011. http://scholarscompass.vcu.edu/etd/2455.
Повний текст джерелаSrikanthan, T. "Bond graph analysis." Thesis, Coventry University, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.373896.
Повний текст джерелаChen, Xujin, and 陳旭瑾. "Graph partitions and integer flows." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2004. http://hub.hku.hk/bib/B30286256.
Повний текст джерелаVella, Antoine. "A Fundamentally Topological Perspective on Graph Theory." Thesis, University of Waterloo, 2005. http://hdl.handle.net/10012/1033.
Повний текст джерелаDouma, Femke. "Counting and averaging problems in graph theory." Thesis, Durham University, 2010. http://etheses.dur.ac.uk/272/.
Повний текст джерелаAl-Shimary, Abbas. "Applications of graph theory to quantum computation." Thesis, University of Leeds, 2013. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.608359.
Повний текст джерелаYilma, Zelealem Belaineh. "Results in Extremal Graph and Hypergraph Theory." Research Showcase @ CMU, 2011. http://repository.cmu.edu/dissertations/49.
Повний текст джерела