Relevant bibliographies by topics / THEORY OF SIGNED GRAPHS / Dissertations / Theses
To see the other types of publications on this topic, follow the link: THEORY OF SIGNED GRAPHS.

Dissertations / Theses on the topic 'THEORY OF SIGNED GRAPHS'

Author: Grafiati
Published: 11 September 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'THEORY OF SIGNED GRAPHS.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Bowlin, Garry. "Maximum frustration of bipartite signed graphs." Diss., Online access via UMI:, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Wang, Jue. "Algebraic structures of signed graphs /." View abstract or full-text, 2007. http://library.ust.hk/cgi/db/thesis.pl?MATH%202007%20WANG.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Sen, Sagnik. "A contribution to the theory of graph homomorphisms and colorings." Phd thesis, Bordeaux, 2014. http://tel.archives-ouvertes.fr/tel-00960893.

Full text
Abstract:
Dans cette thèse, nous considérons des questions relatives aux homomorphismes de quatre types distincts de graphes : les graphes orientés, les graphes orientables, les graphes 2-arête colorés et les graphes signés. Pour chacun des ces quatre types, nous cherchons à déterminer le nombre chromatique, le nombre de clique relatif et le nombre de clique absolu pour différentes familles de graphes planaires : les graphes planaires extérieurs, les graphes planaires extérieurs de maille fixée, les graphes planaires et les graphes planaires de maille fixée. Nous étudions également les étiquetages "2-di
APA, Harvard, Vancouver, ISO, and other styles
4

Sivaraman, Vaidyanathan. "Some Topics concerning Graphs, Signed Graphs and Matroids." The Ohio State University, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=osu1354645035.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Sun, Qiang. "A contribution to the theory of (signed) graph homomorphism bound and Hamiltonicity." Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLS109/document.

Full text
Abstract:
Dans cette thèse, nous etudions deux principaux problèmes de la théorie des graphes: problème d’homomorphisme des graphes planaires (signés) et problème de cycle hamiltonien.Comme une extension du théorème des quatre couleurs, il est conjecturé([80], [41]) que chaque graphe signé cohérent planaire de déséquilibré-maille d+1(d>1) admet un homomorphisme à cube projective signé SPC(d) de dimension d. La question suivant étalés naturelle:Est-ce que SPC(d) une borne optimale de déséquilibré-maille d+1 pour tous les graphes signés cohérente planaire de déséquilibré-maille d+1?Au Chapitre 2, nous
APA, Harvard, Vancouver, ISO, and other styles
6

Kotzagiannidis, Madeleine S. "From spline wavelet to sampling theory on circulant graphs and beyond : conceiving sparsity in graph signal processing." Thesis, Imperial College London, 2017. http://hdl.handle.net/10044/1/56614.

Full text
Abstract:
Graph Signal Processing (GSP), as the field concerned with the extension of classical signal processing concepts to the graph domain, is still at the beginning on the path toward providing a generalized theory of signal processing. As such, this thesis aspires to conceive the theory of sparse representations on graphs by traversing the cornerstones of wavelet and sampling theory on graphs. Beginning with the novel topic of graph spline wavelet theory, we introduce families of spline and e-spline wavelets, and associated filterbanks on circulant graphs, which lever- age an inherent vanishing mo
APA, Harvard, Vancouver, ISO, and other styles
7

Lucas, Claire. "Trois essais sur les relations entre les invariants structuraux des graphes et le spectre du Laplacien sans signe." Phd thesis, Ecole Polytechnique X, 2013. http://pastel.archives-ouvertes.fr/pastel-00956183.

Full text
Abstract:
Le spectre du Laplacien sans signe a fait l'objet de beaucoup d'attention dans la communauté scientifique ces dernières années. La principale raison est l'intuition, basée sur une étude des petits graphes et sur des propriétés valides pour des graphes de toutes tailles, que plus de graphes sont déterminés par le spectre de cette matrice que par celui de la matrice d'adjacence et du Laplacien. Les travaux présentés dans cette thèse ont apporté des éléments nouveaux sur les informations contenues dans le spectre cette matrice. D'une part, on y présente des relations entre les invariants de struc
APA, Harvard, Vancouver, ISO, and other styles
8

Mutar, Mohammed A. "Hamiltonicity in Bidirected Signed Graphs and Ramsey Signed Numbers." Wright State University / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=wright1513377549200572.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kang, Yingli [Verfasser]. "Coloring of signed graphs / Yingli Kang." Paderborn : Universitätsbibliothek, 2018. http://d-nb.info/1153824663/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Omeroglu, Nurettin Burak. "K-way Partitioning Of Signed Bipartite Graphs." Master's thesis, METU, 2012. http://etd.lib.metu.edu.tr/upload/12614817/index.pdf.

Full text
Abstract:
Clustering is the process in which data is differentiated, classified according to some criteria. As a result of partitioning process, data is grouped into clusters for specific purpose. In a social network, clustering of people is one of the most popular problems. Therefore, we mainly concentrated on finding an efficient algorithm for this problem. In our study, data is made up of two types of entities (e.g., people, groups vs. political issues, religious beliefs) and distinct from most previous works, signed weighted bipartite graphs are used to model relations among them. For the partitioni
APA, Harvard, Vancouver, ISO, and other styles
11

Schubert, Michael [Verfasser]. "Circular flows on signed graphs / Michael Schubert." Paderborn : Universitätsbibliothek, 2018. http://d-nb.info/1161798684/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
12

Le, Falher Géraud. "Characterizing edges in signed and vector-valued graphs." Thesis, Lille 1, 2018. http://www.theses.fr/2018LIL1I013/document.

Full text
Abstract:
Nous proposons des méthodes pour caractériser efficacement les arêtes au sein de réseaux complexes. Dans les graphes simples, les nœuds sont liés par une sémantique unique, tels deux utilisateurs amis dans un réseau social. De plus, ces arêtes sont guidées par la similarité entre les nœuds (homophilie). Ainsi, les membres deviennent amis à cause de caractéristiques communes. En revanche, les réseaux complexes sont des graphes où chaque arête possède une sémantique parmi k possibles. Ces arêtes sont de plus basées à la fois sur une homophilie et une hétérophilie partielle. Cette information sup
APA, Harvard, Vancouver, ISO, and other styles
13

Papalamprou, Konstantinos. "Structural and decomposition results for binet matrices, bidirected graphs and signed-graphic matroids." Thesis, London School of Economics and Political Science (University of London), 2009. http://etheses.lse.ac.uk/2193/.

Full text
Abstract:
In this thesis we deal with binet matrices and the class of signed-graphic matroids which is the class of matroids represented over R by binet matrices. The thesis is divided in three parts. In the first part, we provide the vast majority of the notions used throughout the thesis and some results regarding the class of binet matrices. In this part, we focus on the class of linear and integer programming problems in which the constraint matrix is binet and provide methods and algorithms which solve these problems efficiently. The main new result is that the existing combinatorial methods can no
APA, Harvard, Vancouver, ISO, and other styles
14

Lamb, John D. "Theory of bond graphs." Thesis, University of Nottingham, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.239418.

Full text
APA, Harvard, Vancouver, ISO, and other styles
15

Borinsky, Michael. "Graphs in perturbation theory." Doctoral thesis, Humboldt-Universität zu Berlin, 2018. http://dx.doi.org/10.18452/19201.

Full text
Abstract:
Inhalt dieser Arbeit ist eine Erweiterung der Hopfalgebrastruktur der Feynmangraphen und Renormierung von Connes und Kreimer. Zusätzlich wird eine Struktur auf faktoriell wachsenden Potenzreihen eingeführt, die deren asymptotisches Wachstum beschreibt und die kompatibel mit der Hopfalgebrastruktur ist. Die Hopfalgebrastruktur auf Graphen erlaubt die explizite Enumeration von Graphen mit Einschränkungen in Bezug auf die erlaubten Untergraphen. Im Fall der Feynmangraphen wird zusätzlich eine algebraische Verbandstruktur eingeführt, die weitere eindeutige Eigenschaften von physikalischen Quan
APA, Harvard, Vancouver, ISO, and other styles
16

Badaoui, Mohamad. "G-graphs and Expander graphs." Thesis, Normandie, 2018. http://www.theses.fr/2018NORMC207/document.

Full text
Abstract:
L’utilisation de l’algèbre pour résoudre des problèmes de graphes a conduit au développement de trois branches : théorie spectrale des graphes, géométrie et combinatoire des groupes et études des invariants de graphes. La notion de graphe d’expansions (invariant de graphes) est relativement récente, elle a été développée afin d’étudier la robustesse des réseaux de télécommunication. Il s’avère que la construction de familles infinies de graphes expanseurs est un problème difficile. Cette thèse traite principalement de la construction de nouvelles familles de tels graphes. Les graphes expanseur
APA, Harvard, Vancouver, ISO, and other styles
17

Mighton, John 1957. "Knot theory on bipartite graphs." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp03/NQ49930.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
18

Backman, Spencer Christopher Foster. "Combinatorial divisor theory for graphs." Diss., Georgia Institute of Technology, 2014. http://hdl.handle.net/1853/51908.

Full text
Abstract:
Chip-firing is a deceptively simple game played on the vertices of a graph, which was independently discovered in probability theory, poset theory, graph theory, and statistical physics. In recent years, chip-firing has been employed in the development of a theory of divisors on graphs analogous to the classical theory for Riemann surfaces. In particular, Baker and Norin were able to use this set up to prove a combinatorial Riemann-Roch formula, whose classical counterpart is one of the cornerstones of modern algebraic geometry. It is now understood that the relationship between divisor theor
APA, Harvard, Vancouver, ISO, and other styles
19

Hoang, Chinh T. "Perfect graphs." Thesis, McGill University, 1985. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=74011.

Full text
APA, Harvard, Vancouver, ISO, and other styles
20

Möller, Rögnvaldur G. "Groups acting on graphs." Thesis, University of Oxford, 1991. http://ora.ox.ac.uk/objects/uuid:2dacfc67-56c4-4541-b52e-10199a13dcc2.

Full text
Abstract:
In the first part of this thesis we investigate the automorphism groups of regular trees. In the second part we look at the action of the automorphism group of a locally finite graph on the ends of the graph. The two part are not directly related but trees play a fundamental role in both parts. Let T<sub>n</sub> be the regular tree of valency n. Put G := Aut(T<sub>n</sub>) and let G<sub>0</sub> be the subgroup of G that is generated by the stabilisers of points. The main results of the first part are : Theorem 4.1 Suppose 3 ≤ n < N<sub>0</sub> and α ϵ T<sub>n</sub>. Then G<sub>α</sub> (the sta
APA, Harvard, Vancouver, ISO, and other styles
21

Jagger, Christopher Neil. "Partitions of graphs." Thesis, University of Cambridge, 1995. https://www.repository.cam.ac.uk/handle/1810/251583.

Full text
APA, Harvard, Vancouver, ISO, and other styles
22

Al-Doujan, Fawwaz Awwad. "Spectra of graphs." Thesis, University of East Anglia, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.306195.

Full text
APA, Harvard, Vancouver, ISO, and other styles
23

Chan, Wai Hong. "Bandwidth problems of graphs." HKBU Institutional Repository, 1996. http://repository.hkbu.edu.hk/etd_ra/62.

Full text
APA, Harvard, Vancouver, ISO, and other styles
24

Macon, Lisa Fischer. "Almost regular graphs and edge-face colorings of plane graphs." Orlando, Fla. : University of Central Florida, 2009. http://purl.fcla.edu/fcla/etd/CFE0002507.

Full text
APA, Harvard, Vancouver, ISO, and other styles
25

Pearce, Geoffrey. "Transitive decompositions of graphs." University of Western Australia. School of Mathematics and Statistics, 2008. http://theses.library.uwa.edu.au/adt-WU2008.0087.

Full text
Abstract:
A transitive decomposition of a graph is a partition of the arc set such that there exists a group of automorphisms of the graph which preserves and acts transitively on the partition. This turns out to be a very broad idea, with several striking connections with other areas of mathematics. In this thesis we first develop some general theory of transitive decompositions, and in particular we illustrate some of the more interesting connections with certain combinatorial and geometric structures. We then give complete, or nearly complete, structural characterisations of certain classes of transi
APA, Harvard, Vancouver, ISO, and other styles
26

Wojciechowska, Iwona. "Broadcasting in grid graphs." Morgantown, W. Va. : [West Virginia University Libraries], 1999. http://etd.wvu.edu/templates/showETD.cfm?recnum=877.

Full text
Abstract:
Thesis (Ph. D.)--West Virginia University, 1999.<br>Title from document title page. Document formatted into pages; contains vii, 69 p. : ill. Includes abstract. Includes bibliographical references (p. 67-69).
APA, Harvard, Vancouver, ISO, and other styles
27

Montgomery, Bruce Lee. "Dynamic coloring of graphs." Morgantown, W. Va. : [West Virginia University Libraries], 2001. http://etd.wvu.edu/templates/showETD.cfm?recnum=2109.

Full text
Abstract:
Thesis (Ph. D.)--West Virginia University, 2001.<br>Title from document title page. Document formatted into pages; contains viii, 52 p. : ill. Vita. Includes abstract. Includes bibliographical references (p. 51).
APA, Harvard, Vancouver, ISO, and other styles
28

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.

Full text
Abstract:
This document is a long abstract of my research work, concerning graph theory and algorithms on graphs. It summarizes some results, gives ideas of the proof for some of them and presents the context of the different topics together with some interesting open questions connected to them The first part precises the notations used in the rest of the paper; the second part deals with some problems on cycles in digraphs; the third part is an overview of two graph coloring problems and one problem on structures in colored graphs; finally the fourth part focus on some results in algorithmic graph the
APA, Harvard, Vancouver, ISO, and other styles
29

Srinivasa, Christopher. "Graph Theory for the Discovery of Non-Parametric Audio Objects." Thèse, Université d'Ottawa / University of Ottawa, 2011. http://hdl.handle.net/10393/20126.

Full text
Abstract:
A novel framework based on cluster co-occurrence and graph theory for structure discovery is applied to audio to find new types of audio objects which enable the compression of an input signal. These new objects differ from those found in current object coding schemes as their shape is not restricted by any a priori psychoacoustic knowledge. The framework is novel from an application perspective, as it marks the first time that graph theory is applied to audio, and with regards to theoretical developments, as it involves new extensions to the areas of unsupervised learning algorithms and frequ
APA, Harvard, Vancouver, ISO, and other styles
30

Thwaites, Peter. "Chain event graphs : theory and application." Thesis, University of Warwick, 2008. http://wrap.warwick.ac.uk/49194/.

Full text
Abstract:
This thesis is concerned with the Graphical model known as the Chain Event Graph (CEG) [1][60][61], and develops the theory that appears in the currently published papers on this work. Results derived are analogous to those produced for Bayesian Networks (BNs), and I show that for asymmetric problems the CEG is generally superior to the BN both as a representation of the problem and as an analytical tool. The CEG is designed to embody the conditional independence structure of problems whose state spaces are asymmetric and do not admit a natural Product Space structure. In this they differ from
APA, Harvard, Vancouver, ISO, and other styles
31

Wagner, Peter. "The Ramsey theory of multicoloured graphs." Thesis, University of Cambridge, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.614225.

Full text
APA, Harvard, Vancouver, ISO, and other styles
32

Jonsson, Jakob. "Simplicial complexes of graphs /." Berlin [u.a.] : Springer, 2008. http://dx.doi.org/10.1007/978-3-540-75858-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
33

Williams, Trevor K. "Combinatorial Games on Graphs." DigitalCommons@USU, 2017. https://digitalcommons.usu.edu/etd/6502.

Full text
Abstract:
Combinatorial games are intriguing and have a tendency to engross students and lead them into a serious study of mathematics. The engaging nature of games is the basis for this thesis. Two combinatorial games along with some educational tools were developed in the pursuit of the solution of these games. The game of Nim is at least centuries old, possibly originating in China, but noted in the 16th century in European countries. It consists of several stacks of tokens, and two players alternate taking one or more tokens from one of the stacks, and the player who cannot make a move loses. The fo
APA, Harvard, Vancouver, ISO, and other styles
34

Wang, Jiaxin. "Various pushing methods on grid graphs." Morgantown, W. Va. : [West Virginia University Libraries], 1999. http://etd.wvu.edu/templates/showETD.cfm?recnum=839.

Full text
Abstract:
Thesis (M.S.)--West Virginia University, 1999.<br>Title from document title page. Document formatted into pages; contains v, 39 p. : ill. (some col.) Includes abstract. Includes bibliographical references (p. 39).
APA, Harvard, Vancouver, ISO, and other styles
35

Hunt, D'Hania J. "Constructing higher-order de Bruijn graphs." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2002. http://library.nps.navy.mil/uhtbin/hyperion-image/02Jun%5FHunt.pdf.

Full text
Abstract:
Thesis (M.S. in Applied Mathematics)--Naval Postgraduate School, June 2002.<br>Thesis advisor(s): Harold Fredricksen, Craig W. Rasmussen. Includes bibliographical references (p. 45-46). Also available online.
APA, Harvard, Vancouver, ISO, and other styles
36

Meagher, Karen. "Covering arrays on graphs: Qualitative independence graphs and extremal set partition theory." Thesis, University of Ottawa (Canada), 2005. http://hdl.handle.net/10393/29234.

Full text
Abstract:
There has been a good deal of research on covering arrays over the last 20 years. Most of this work has focused on constructions, applications and generalizations of covering arrays. The main focus of this thesis is a generalization of covering arrays, covering arrays on graphs. The original motivation for this generalization was to improve applications of covering arrays to testing systems and networks, but this extension also gives us new ways to study covering arrays. Two vectors v, w in Znk are qualitatively independent if for all ordered pairs (a, b) &isin; Zk x Zk there is a po
APA, Harvard, Vancouver, ISO, and other styles
37

Song, Zengmin. "Cycles and coloring in graphs." HKBU Institutional Repository, 2001. http://repository.hkbu.edu.hk/etd_ra/285.

Full text
APA, Harvard, Vancouver, ISO, and other styles
38

Ngô, Van Chan. "Formal verification of a synchronous data-flow compiler : from Signal to C." Phd thesis, Université Rennes 1, 2014. http://tel.archives-ouvertes.fr/tel-01067477.

Full text
Abstract:
Synchronous languages such as Signal, Lustre and Esterel are dedicated to designing safety-critical systems. Their compilers are large and complicated programs that may be incorrect in some contexts, which might produce silently bad compiled code when compiling source programs. The bad compiled code can invalidate the safety properties that are guaranteed on the source programs by applying formal methods. Adopting the translation validation approach, this thesis aims at formally proving the correctness of the highly optimizing and industrial Signal compiler. The correctness proof represents bo
APA, Harvard, Vancouver, ISO, and other styles
39

Hill, Alan. "Self-Dual Graphs." Thesis, University of Waterloo, 2002. http://hdl.handle.net/10012/1014.

Full text
Abstract:
The study of self-duality has attracted some attention over the past decade. A good deal of research in that time has been done on constructing and classifying all self-dual graphs and in particular polyhedra. We will give an overview of the recent research in the first two chapters. In the third chapter, we will show the necessary condition that a self-complementary self-dual graph have <i>n</i> &#8801; 0, 1 (mod 8) vertices and we will review White's infinite class (the Paley graphs, for which <i>n</i> &#8801; 1 (mod 8)). Finally, we will construct a new infinite class of self-co
APA, Harvard, Vancouver, ISO, and other styles
40

Olariu, Stephan. "Results on perfect graphs." Thesis, McGill University, 1986. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=73997.

Full text
APA, Harvard, Vancouver, ISO, and other styles
41

Hearn, John. "Kolmogorov Complexity of Graphs." Scholarship @ Claremont, 2006. https://scholarship.claremont.edu/hmc_theses/182.

Full text
Abstract:
Kolmogorov complexity is a theory based on the premise that the complexity of a binary string can be measured by its compressibility; that is, a string’s complexity is the length of the shortest program that produces that string. We explore applications of this measure to graph theory.
APA, Harvard, Vancouver, ISO, and other styles
42

Ferra, Gomes de Almeida Girão António José. "Extremal and structural problems of graphs." Thesis, University of Cambridge, 2019. https://www.repository.cam.ac.uk/handle/1810/285427.

Full text
Abstract:
In this dissertation, we are interested in studying several parameters of graphs and understanding their extreme values. We begin in Chapter~$2$ with a question on edge colouring. When can a partial proper edge colouring of a graph of maximum degree $\Delta$ be extended to a proper colouring of the entire graph using an `optimal' set of colours? Albertson and Moore conjectured this is always possible provided no two precoloured edges are within distance $2$. The main result of Chapter~$2$ comes close to proving this conjecture. Moreover, in Chapter~$3$, we completely answer the previous questi
APA, Harvard, Vancouver, ISO, and other styles
43

Heckman, Christopher Carl. "Independent sets in bounded degree graphs." Diss., Georgia Institute of Technology, 2000. http://hdl.handle.net/1853/29163.

Full text
APA, Harvard, Vancouver, ISO, and other styles
44

Lo, Allan. "Cliques in graphs." Thesis, University of Cambridge, 2010. https://www.repository.cam.ac.uk/handle/1810/237438.

Full text
Abstract:
The main focus of this thesis is to evaluate .k_r(n,\delta)., the minimal number of $r$-cliques in graphs with $n$ vertices and minimum degree~$\delta$. A fundamental result in Graph Theory states that a triangle-free graph of order $n$ has at most $n 2/4$ edges. Hence, a triangle-free graph has minimum degree at most $n/2$, so if $k_3(n,\delta) =0$ then $\delta \le n/2$. For $n/2 \leq \delta \leq 4n/5$, I have evaluated $k_r(n,\delta)$ and determined the structures of the extremal graphs. For $\delta \ge 4n/5$, I give a conjecture on $k_r(n,\delta)$, as well as the structures of these extrema
APA, Harvard, Vancouver, ISO, and other styles
45

Norine, Serguei. "Matching structure and Pfaffian orientations of graphs." Diss., Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/7232.

Full text
Abstract:
The first result of this thesis is a generation theorem for bricks. A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. The importance of bricks stems from the fact that they are building blocks of a decomposition procedure of Kotzig, and Lovasz and Plummer. We prove that every brick except for the Petersen graph can be generated from K_4 or the prism by repeatedly applying certain operations in such a way that all the intermediate graphs are bricks. We use this theorem to prove an exact upper bound on the number of
APA, Harvard, Vancouver, ISO, and other styles
46

White, M. D. "Cycles in edge-coloured graphs and subgraphs of random graphs." Thesis, University of Oxford, 2011. http://ora.ox.ac.uk/objects/uuid:95ef351e-acb1-442c-adf5-970487e30a4d.

Full text
Abstract:
This thesis will study a variety of problems in graph theory. Initially, the focus will be on finding minimal degree conditions which guarantee the existence of various subgraphs. These subgraphs will all be formed of cycles, and this area of work will fall broadly into two main categories. First to be considered are cycles in edge-coloured graphs and, in particular, two questions of Li, Nikiforov and Schelp. It will be shown that a 2-edge-coloured graph with minimal degree at least 3n/4 either is isomorphic to the complete 4-partite graph with classes of order n/4, or contains monochromatic c
APA, Harvard, Vancouver, ISO, and other styles
47

Ali, Seema. "Colouring generalized Kneser graphs and homotopy theory." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape15/PQDD_0014/MQ34938.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
48

Dickson, James Odziemiec. "An Introduction to Ramsey Theory on Graphs." Thesis, Virginia Tech, 2011. http://hdl.handle.net/10919/32873.

Full text
APA, Harvard, Vancouver, ISO, and other styles
49

Brody, Justin. "On the model theory of random graphs." College Park, Md. : University of Maryland, 2009. http://hdl.handle.net/1903/9291.

Full text
Abstract:
Thesis (Ph.D.) -- University of Maryland, College Park, 2009.<br>Thesis research directed by: Dept. of Mathematics. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.
APA, Harvard, Vancouver, ISO, and other styles
50

Montgomery, Richard Harford. "Minors and spanning trees in graphs." Thesis, University of Cambridge, 2015. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.709278.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography