Relevant bibliographies by topics / Combinatorics – Graph theory – Graph theory

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Combinatorics – Graph theory – Graph theory'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 February 2022

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Combinatorics – Graph theory – Graph theory.'

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.

Journal articles on the topic "Combinatorics – Graph theory – Graph theory"

1

Leversha, Gerry, John M. Harris, Jeffry L. Hirst, and Michael J. Mossinghoff. "Combinatorics and Graph Theory." Mathematical Gazette 86, no. 505 (March 2002): 177. http://dx.doi.org/10.2307/3621627.

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

Sebő, András, and Zoltán Szigeti. "Preface: Graph theory and combinatorics." Discrete Applied Mathematics 209 (August 2016): 1. http://dx.doi.org/10.1016/j.dam.2016.02.021.

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

ILYUTKO, DENIS PETROVICH, and VASSILY OLEGOVICH MANTUROV. "INTRODUCTION TO GRAPH-LINK THEORY." Journal of Knot Theory and Its Ramifications 18, no. 06 (June 2009): 791–823. http://dx.doi.org/10.1142/s0218216509007191.

Full text
Abstract:
The present paper is an introduction to a combinatorial theory arising as a natural generalization of classical and virtual knot theory. There is a way to encode links by a class of "realizable" graphs. When passing to generic graphs with the same equivalence relations we get "graph-links". On one hand graph-links generalize the notion of virtual link, on the other hand they do not detect link mutations. We define the Jones polynomial for graph-links and prove its invariance. We also prove some a generalization of the Kauffman–Murasugi–Thistlethwaite theorem on "minimal diagrams" for graph-links.
APA, Harvard, Vancouver, ISO, and other styles
4

Bóna, Miklós. "Review of Combinatorics and graph theory." ACM SIGACT News 40, no. 3 (September 25, 2009): 37–39. http://dx.doi.org/10.1145/1620491.1620496.

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

CONLEY, CLINTON T., ALEXANDER S. KECHRIS, and ROBIN D. TUCKER-DROB. "Ultraproducts of measure preserving actions and graph combinatorics." Ergodic Theory and Dynamical Systems 33, no. 2 (February 16, 2012): 334–74. http://dx.doi.org/10.1017/s0143385711001143.

Full text
Abstract:
AbstractUltraproducts of measure preserving actions of countable groups are used to study the graph combinatorics associated with such actions, including chromatic, independence and matching numbers. Applications are also given to the theory of random colorings of Cayley graphs and sofic actions and equivalence relations.
APA, Harvard, Vancouver, ISO, and other styles
6

CSIKVÁRI, PÉTER, and ZOLTÁN LÓRÁNT NAGY. "The Density Turán Problem." Combinatorics, Probability and Computing 21, no. 4 (February 29, 2012): 531–53. http://dx.doi.org/10.1017/s0963548312000016.

Full text
Abstract:
LetHbe a graph onnvertices and let the blow-up graphG[H] be defined as follows. We replace each vertexviofHby a clusterAiand connect some pairs of vertices ofAiandAjif (vi,vj) is an edge of the graphH. As usual, we define the edge density betweenAiandAjasWe study the following problem. Given densities γijfor each edge (i,j) ∈E(H), one has to decide whether there exists a blow-up graphG[H], with edge densities at least γij, such that one cannot choose a vertex from each cluster, so that the obtained graph is isomorphic toH,i.e., noHappears as a transversal inG[H]. We calldcrit(H) the maximal value for which there exists a blow-up graphG[H] with edge densitiesd(Ai,Aj)=dcrit(H) ((vi,vj) ∈E(H)) not containingHin the above sense. Our main goal is to determine the critical edge density and to characterize the extremal graphs.First, in the case of treeTwe give an efficient algorithm to decide whether a given set of edge densities ensures the existence of a transversalTin the blow-up graph. Then we give general bounds ondcrit(H) in terms of the maximal degree. In connection with the extremal structure, the so-called star decomposition is proved to give the best construction forH-transversal-free blow-up graphs for several graph classes. Our approach applies algebraic graph-theoretical, combinatorial and probabilistic tools.
APA, Harvard, Vancouver, ISO, and other styles
7

Stein, Maya. "Extremal infinite graph theory." Discrete Mathematics 311, no. 15 (August 2011): 1472–96. http://dx.doi.org/10.1016/j.disc.2010.12.018.

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

ALON, NOGA. "Combinatorial Nullstellensatz." Combinatorics, Probability and Computing 8, no. 1-2 (January 1999): 7–29. http://dx.doi.org/10.1017/s0963548398003411.

Full text
Abstract:
We present a general algebraic technique and discuss some of its numerous applications in combinatorial number theory, in graph theory and in combinatorics. These applications include results in additive number theory and in the study of graph colouring problems. Many of these are known results, to which we present unified proofs, and some results are new.
APA, Harvard, Vancouver, ISO, and other styles
9

Dobrinen, Natasha. "The Ramsey theory of the universal homogeneous triangle-free graph." Journal of Mathematical Logic 20, no. 02 (January 28, 2020): 2050012. http://dx.doi.org/10.1142/s0219061320500129.

Full text
Abstract:
The universal homogeneous triangle-free graph, constructed by Henson [A family of countable homogeneous graphs, Pacific J. Math. 38(1) (1971) 69–83] and denoted [Formula: see text], is the triangle-free analogue of the Rado graph. While the Ramsey theory of the Rado graph has been completely established, beginning with Erdős–Hajnal–Posá [Strong embeddings of graphs into coloured graphs, in Infinite and Finite Sets. Vol.[Formula: see text] , eds. A. Hajnal, R. Rado and V. Sós, Colloquia Mathematica Societatis János Bolyai, Vol. 10 (North-Holland, 1973), pp. 585–595] and culminating in work of Sauer [Coloring subgraphs of the Rado graph, Combinatorica 26(2) (2006) 231–253] and Laflamme–Sauer–Vuksanovic [Canonical partitions of universal structures, Combinatorica 26(2) (2006) 183–205], the Ramsey theory of [Formula: see text] had only progressed to bounds for vertex colorings [P. Komjáth and V. Rödl, Coloring of universal graphs, Graphs Combin. 2(1) (1986) 55–60] and edge colorings [N. Sauer, Edge partitions of the countable triangle free homogenous graph, Discrete Math. 185(1–3) (1998) 137–181]. This was due to a lack of broadscale techniques. We solve this problem in general: For each finite triangle-free graph [Formula: see text], there is a finite number [Formula: see text] such that for any coloring of all copies of [Formula: see text] in [Formula: see text] into finitely many colors, there is a subgraph of [Formula: see text] which is again universal homogeneous triangle-free in which the coloring takes no more than [Formula: see text] colors. This is the first such result for a homogeneous structure omitting copies of some nontrivial finite structure. The proof entails developments of new broadscale techniques, including a flexible method for constructing trees which code [Formula: see text] and the development of their Ramsey theory.
APA, Harvard, Vancouver, ISO, and other styles
10

Cvetkovic, Dragos, Pierre Hansen, and Vera Kovacevic-Vujcic. "On some interconnections between combinatorial optimization and extremal graph theory." Yugoslav Journal of Operations Research 14, no. 2 (2004): 147–54. http://dx.doi.org/10.2298/yjor0402147c.

Full text
Abstract:
The uniting feature of combinatorial optimization and extremal graph theory is that in both areas one should find extrema of a function defined in most cases on a finite set. While in combinatorial optimization the point is in developing efficient algorithms and heuristics for solving specified types of problems, the extremal graph theory deals with finding bounds for various graph invariants under some constraints and with constructing extremal graphs. We analyze by examples some interconnections and interactions of the two theories and propose some conclusions.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Combinatorics – Graph theory – Graph theory"

1

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.

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

Krohne, Edward. "Continuous Combinatorics of a Lattice Graph in the Cantor Space." Thesis, University of North Texas, 2016. https://digital.library.unt.edu/ark:/67531/metadc849680/.

Full text
Abstract:
We present a novel theorem of Borel Combinatorics that sheds light on the types of continuous functions that can be defined on the Cantor space. We specifically consider the part X=F(2ᴳ) from the Cantor space, where the group G is the additive group of integer pairs ℤ². That is, X is the set of aperiodic {0,1} labelings of the two-dimensional infinite lattice graph. We give X the Bernoulli shift action, and this action induces a graph on X in which each connected component is again a two-dimensional lattice graph. It is folklore that no continuous (indeed, Borel) function provides a two-coloring of the graph on X, despite the fact that any finite subgraph of X is bipartite. Our main result offers a much more complete analysis of continuous functions on this space. We construct a countable collection of finite graphs, each consisting of twelve "tiles", such that for any property P (such as "two-coloring") that is locally recognizable in the proper sense, a continuous function with property P exists on X if and only if a function with a corresponding property P' exists on one of the graphs in the collection. We present the theorem, and give several applications.
APA, Harvard, Vancouver, ISO, and other styles
3

Lin, Matthew. "Graph Cohomology." Scholarship @ Claremont, 2016. https://scholarship.claremont.edu/hmc_theses/82.

Full text
Abstract:
What is the cohomology of a graph? Cohomology is a topological invariant and encodes such information as genus and euler characteristic. Graphs are combinatorial objects which may not a priori admit a natural and isomorphism invariant cohomology ring. In this project, given any finite graph G, we constructively define a cohomology ring H*(G) of G. Our method uses graph associahedra and toric varieties. Given a graph, there is a canonically associated convex polytope, called the graph associahedron, constructed from G. In turn, a convex polytope uniquely determines a toric variety. We synthesize these results, and describe the cohomology of the associated variety directly in terms of the graph G itself.
APA, Harvard, Vancouver, ISO, and other styles
4

Weller, Kerstin B. "Connectivity and related properties for graph classes." Thesis, University of Oxford, 2014. http://ora.ox.ac.uk/objects/uuid:667a139e-6d2c-4f67-8487-04c3a0136226.

Full text
Abstract:
There has been much recent interest in random graphs sampled uniformly from the set of (labelled) graphs on n vertices in a suitably structured class A. An important and well-studied example of such a suitable structure is bridge-addability, introduced in 2005 by McDiarmid et al. in the course of studying random planar graphs. A class A is bridge-addable when the following holds: if we take any graph G in A and any pair u,v of vertices that are in different components in G, then the graph G′ obtained by adding the edge uv to G is also in A. It was shown that for a random graph sampled from a bridge-addable class, the probability that it is connected is always bounded away from 0, and the number of components is bounded above by a Poisson law. What happens if ’bridge-addable’ is replaced by something weaker? In this thesis, this question is explored in several different directions. After an introductory chapter and a chapter on generating function methods presenting standard techniques as well as some new technical results needed later, we look at minor-closed, labelled classes of graphs. The excluded minors are always assumed to be connected, which is equivalent to the class A being decomposable - a graph is in A if and only if every component of the graph is in A. When A is minor-closed, decomposable and bridge-addable various properties are known (McDiarmid 2010), generalizing results for planar graphs. A minor-closed class is decomposable and bridge-addable if and only if all excluded minors are 2-connected. Chapter 3 presents a series of examples where the excluded minors are not 2-connected, analysed using generating functions as well as techniques from graph theory. This is a step towards a classification of connectivity behaviour for minor-closed classes of graphs. In contrast to the bridge-addable case, different types of behaviours are observed. Chapter 4 deals with a new, more general vari- ant of bridge-addability related to edge-expander graphs. We will see that as long as we are allowed to introduce ’sufficiently many’ edges between components, the number of components of a random graph can still be bounded above by a Pois- son law. In this context, random forests in Kn,n are studied in detail. Chapter 5 takes a different approach, and studies the class of labelled forests where some vertices belong to a specified stable set. A weighting parameter y for the vertices belonging to the stable set is introduced, and a graph is sampled with probability proportional to y*s where s is the size of its stable set. The behaviour of this class is studied for y tending to ∞. Chapters 6 concerns random graphs sampled from general decomposable classes. We investigate the minimum size of a component, in both the labelled and the unlabelled case.
APA, Harvard, Vancouver, ISO, and other styles
5

Richer, Duncan Christopher. "Graph theory and combinatorial games." Thesis, University of Cambridge, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.621916.

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

Krzywkowski, Marcin Piotr. "Hat problem on a graph." Thesis, University of Exeter, 2012. http://hdl.handle.net/10036/4019.

Full text
Abstract:
The topic of this thesis is the hat problem. In this problem, a team of n players enters a room, and a blue or red hat is randomly placed on the head of each player. Every player can see the hats of all of the other players but not his own. Then each player must simultaneously guess the color of his own hat or pass. The team wins if at least one player guesses his hat color correctly and no one guesses his hat color wrong, otherwise the team loses. The aim is to maximize the probability of winning. This thesis is based on publications, which form the second chapter. In the first chapter we give an overview of the published results. In Section 1.1 we introduce to the hat problem and the hat problem on a graph, where vertices correspond to players, and a player can see the adjacent players. To the hat problem on a graph we devote the next few sections. First, we give some fundamental theorems about the problem. Then we solve the hat problem on trees, cycles, and unicyclic graphs. Next we consider the hat problem on graphs with a universal vertex. We also investigate the problem on graphs with a neighborhood-dominated vertex. In addition, we consider the hat problem on disconnected graphs. Next we investigate the problem on graphs such that the only known information are degrees of vertices. We also present Nordhaus-Gaddum type inequalities for the hat problem on a graph. In Section 1.6 we investigate the hat problem on directed graphs. The topic of Section 1.7 is the generalized hat problem with q >= 2 colors. A modified hat problem is considered in Section 1.8. In this problem there are n >= 3 players and two colors. The players do not have to guess their hat colors simultaneously and we modify the way of making a guess. We give an optimal strategy for this problem which guarantees the win. Applications of the hat problem and its connections to different areas of science are presented in Section 1.9. We also give there a comprehensive list of variations of the hat problem considered in the literature.
APA, Harvard, Vancouver, ISO, and other styles
7

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 question for the class of planar graphs. Next, in Chapter~$4$, we investigate some Ramsey theoretical problems. We determine exactly what minimum degree a graph $G$ must have to guarantee that, for any two-colouring of $E(G)$, we can partition $V(G)$ into two parts where each part induces a connected monochromatic subgraph. This completely resolves a conjecture of Bal and Debiasio. We also prove a `covering' version of this result. Finally, we study another variant of these problems which deals with coverings of a graph by monochromatic components of distinct colours. The following saturation problem proposed by Barrus, Ferrara, Vandenbussche, and Wenger is considered in Chapter~$5$. Given a graph $H$ and a set of colours $\{1,2,\ldots,t\}$ (for some integer $t\geq |E(H)|$), we define $sat_{t}(n, R(H))$ to be the minimum number of $t$-coloured edges in a graph on $n$ vertices which does not contain a rainbow copy of $H$ but the addition of any non-edge in any colour from $\{1,2,\ldots,t\}$ creates such a copy. We prove several results concerning these extremal numbers. In particular, we determine the correct order of $sat_{t}(n, R(H))$, as a function of $n$, for every connected graph $H$ of minimum degree greater than $1$ and for every integer $t\geq e(H)$. In Chapter~$6$, we consider the following question: under what conditions does a Hamiltonian graph on $n$ vertices possess a second cycle of length at least $n-o(n)$? We prove that the `weak' assumption of a minimum degree greater or equal to $3$ guarantees the existence of such a long cycle. We solve two problems related to majority colouring in Chapter~$7$. This topic was recently studied by Kreutzer, Oum, Seymour, van der Zypen and Wood. They raised the problem of determining, for a natural number $k$, the smallest positive integer $m = m(k)$ such that every digraph can be coloured with $m$ colours, where each vertex has the same colour as at most a proportion of $\frac{1}{k}$ of its out-neighbours. Our main theorem states that $m(k) \in \{2k-1, 2k\}$. We study the following problem, raised by Caro and Yuster, in Chapter~$8$. Does every graph $G$ contain a `large' induced subgraph $H$ which has $k$ vertices of degree exactly $\Delta(H)$? We answer in the affirmative an approximate version of this question. Indeed, we prove that, for every $k$, there exists $g(k)$ such that any $n$ vertex graph $G$ with maximum degree $\Delta$ contains an induced subgraph $H$ with at least $n-g(k)\sqrt{\Delta}$ vertices such that $V(H)$ contains at least $k$ vertices of the same degree $d \ge \Delta(H)-g(k)$. This result is sharp up to the order of $g(k)$. %Subsequently, we investigate a concept called $\textit{path-pairability}$. A graph is said to be path-pairable if for any pairing of its vertices there exist a collection of edge-disjoint paths routing the the vertices of each pair. A question we are concerned here asks whether every planar path pairable graph on $n$ vertices must possess a vertex of degree linear in $n$. Indeed, we answer this question in the affirmative. We also sketch a proof resolving an analogous question for graphs embeddable on surfaces of bounded genus. Finally, in Chapter~$9$, we move on to examine $k$-linked tournaments. A tournament $T$ is said to be $k$-linked if for any two disjoint sets of vertices $\{x_1,\ldots ,x_k\}$ and $\{y_1,\dots,y_k\}$ there are directed vertex disjoint paths $P_1,\dots, P_k$ such that $P_i$ joins $x_i$ to $y_i$ for $i = 1,\ldots, k$. We prove that any $4k$ strongly-connected tournament with sufficiently large minimum out-degree is $k$-linked. This result comes close to proving a conjecture of Pokrovskiy.
APA, Harvard, Vancouver, ISO, and other styles
8

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
9

Milicevic, Luka. "Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics." Thesis, University of Cambridge, 2018. https://www.repository.cam.ac.uk/handle/1810/273375.

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

Burns, Jonathan. "Recursive Methods in Number Theory, Combinatorial Graph Theory, and Probability." Scholar Commons, 2014. https://scholarcommons.usf.edu/etd/5193.

Full text
Abstract:
Recursion is a fundamental tool of mathematics used to define, construct, and analyze mathematical objects. This work employs induction, sieving, inversion, and other recursive methods to solve a variety of problems in the areas of algebraic number theory, topological and combinatorial graph theory, and analytic probability and statistics. A common theme of recursively defined functions, weighted sums, and cross-referencing sequences arises in all three contexts, and supplemented by sieving methods, generating functions, asymptotics, and heuristic algorithms. In the area of number theory, this work generalizes the sieve of Eratosthenes to a sequence of polynomial values called polynomial-value sieving. In the case of quadratics, the method of polynomial-value sieving may be characterized briefly as a product presentation of two binary quadratic forms. Polynomials for which the polynomial-value sieving yields all possible integer factorizations of the polynomial values are called recursively-factorable. The Euler and Legendre prime producing polynomials of the form n2+n+p and 2n2+p, respectively, and Landau's n2+1 are shown to be recursively-factorable. Integer factorizations realized by the polynomial-value sieving method, applied to quadratic functions, are in direct correspondence with the lattice point solutions (X,Y) of the conic sections aX2+bXY +cY2+X-nY=0. The factorization structure of the underlying quadratic polynomial is shown to have geometric properties in the space of the associated lattice point solutions of these conic sections. In the area of combinatorial graph theory, this work considers two topological structures that are used to model the process of homologous genetic recombination: assembly graphs and chord diagrams. The result of a homologous recombination can be recorded as a sequence of signed permutations called a micronuclear arrangement. In the assembly graph model, each micronuclear arrangement corresponds to a directed Hamiltonian polygonal path within a directed assembly graph. Starting from a given assembly graph, we construct all the associated micronuclear arrangements. Another way of modeling genetic rearrangement is to represent precursor and product genes as a sequence of blocks which form arcs of a circle. Associating matching blocks in the precursor and product gene with chords produces a chord diagram. The braid index of a chord diagram can be used to measure the scope of interaction between the crossings of the chords. We augment the brute force algorithm for computing the braid index to utilize a divide and conquer strategy. Both assembly graphs and chord diagrams are closely associated with double occurrence words, so we classify and enumerate the double occurrence words based on several notions of irreducibility. In the area of analytic probability, moments abstractly describe the shape of a probability distribution. Over the years, numerous varieties of moments such as central moments, factorial moments, and cumulants have been developed to assist in statistical analysis. We use inversion formulas to compute high order moments of various types for common probability distributions, and show how the successive ratios of moments can be used for distribution and parameter fitting. We consider examples for both simulated binomial data and the probability distribution affiliated with the braid index counting sequence. Finally we consider a sequence of multiparameter binomial sums which shares similar properties with the moment sequences generated by the binomial and beta-binomial distributions. This sequence of sums behaves asymptotically like the high order moments of the beta distribution, and has completely monotonic properties.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Combinatorics – Graph theory – Graph theory"

1

Vasudev, C. Combinatorics and graph theory. New Delhi: New Age International (P) Ltd., Publishers, 2007.

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

Harris, John M. Combinatorics and graph theory. New York: Springer, 2010.

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

Harris, John M., Jeffry L. Hirst, and Michael J. Mossinghoff. Combinatorics and Graph Theory. New York, NY: Springer New York, 2000. http://dx.doi.org/10.1007/978-1-4757-4803-1.

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

Harris, John, Jeffry L. Hirst, and Michael Mossinghoff. Combinatorics and Graph Theory. New York, NY: Springer New York, 2008. http://dx.doi.org/10.1007/978-0-387-79711-3.

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

1957-, Hirst Jeffry L., and Mossinghoff Michael J. 1964-, eds. Combinatorics and graph theory. 2nd ed. New York: Springer, 2008.

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

Rigo, Michel. Advanced Graph Theory and Combinatorics. Hoboken, NJ, USA: John Wiley &;#38; Sons, Inc., 2016. http://dx.doi.org/10.1002/9781119008989.

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

Golumbic, Martin Charles, and Irith Ben-Arroyo Hartman, eds. Graph Theory, Combinatorics and Algorithms. New York: Springer-Verlag, 2005. http://dx.doi.org/10.1007/b106672.

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

International Conference on the Theory and Applications of Graphs (7th 1992 Western Michigan University). Graph theory, combinatorics, and algorithms. New York: Wiley, 1995.

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

Liu, Bolian. Matrices in combinatorics and graph theory. Dordrecht: Kluwer Academic Publishers, 2000.

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

Problems in combinatorics and graph theory. New York: Wiley, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Combinatorics – Graph theory – Graph theory"

1

Harris, John M., Jeffry L. Hirst, and Michael J. Mossinghoff. "Graph Theory." In Combinatorics and Graph Theory, 1–84. New York, NY: Springer New York, 2000. http://dx.doi.org/10.1007/978-1-4757-4803-1_1.

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

Harris, John M., Jeffry L. Hirst, and Michael J. Mossinghoff. "Graph Theory." In Combinatorics and Graph Theory, 1–127. New York, NY: Springer New York, 2008. http://dx.doi.org/10.1007/978-0-387-79711-3_1.

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

Soberón, Pablo. "Graph Theory." In Problem-Solving Methods in Combinatorics, 43–57. Basel: Springer Basel, 2013. http://dx.doi.org/10.1007/978-3-0348-0597-1_4.

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

Mladenović, Pavle. "Graph Theory: Part 1." In Combinatorics, 107–25. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-00831-4_8.

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

Mladenović, Pavle. "Graph Theory: Part 2." In Combinatorics, 127–40. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-00831-4_9.

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

Harris, John M., Jeffry L. Hirst, and Michael J. Mossinghoff. "Combinatorics." In Combinatorics and Graph Theory, 85–159. New York, NY: Springer New York, 2000. http://dx.doi.org/10.1007/978-1-4757-4803-1_2.

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

Harris, John M., Jeffry L. Hirst, and Michael J. Mossinghoff. "Combinatorics." In Combinatorics and Graph Theory, 129–280. New York, NY: Springer New York, 2008. http://dx.doi.org/10.1007/978-0-387-79711-3_2.

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

Redfern, Darren. "Combinatorics and Graph Theory." In The Maple Handbook, 225–56. New York, NY: Springer New York, 1993. http://dx.doi.org/10.1007/978-1-4757-1146-2_8.

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

Redfern, Darren. "Combinatorics and Graph Theory." In The Maple Handbook, 231–63. New York, NY: Springer US, 1994. http://dx.doi.org/10.1007/978-1-4684-0229-2_8.

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

Redfern, Darren. "Combinatorics and Graph Theory." In The Maple Handbook, 196–228. New York, NY: Springer New York, 1996. http://dx.doi.org/10.1007/978-1-4612-2344-3_8.

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

Conference papers on the topic "Combinatorics – Graph theory – Graph theory"

1

Yap, H. P., T. H. Ku, E. K. Lloyd, and Z. M. Wang. "Combinatorics and Graph Theory." In Proceedings of the Spring School and International Conference on Combinatorics. WORLD SCIENTIFIC, 1993. http://dx.doi.org/10.1142/9789814535342.

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

Tung-Hsin, Ku. "Combinatorics and Graph Theory ’95." In Summer School and International Conference on Combinatorics. WORLD SCIENTIFIC, 1995. http://dx.doi.org/10.1142/9789814532495.

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

Baillieul, J., and L. McCoy. "The combinatorial graph theory of structured formations." In 2007 46th IEEE Conference on Decision and Control. IEEE, 2007. http://dx.doi.org/10.1109/cdc.2007.4434931.

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

Brown, Joseph Alexander, and Terry Trowbridge. "Finding the punchline: On applications of graph theory and combinatorics in Canadian 'pataphysical poetry." In 2011 24th IEEE Canadian Conference on Electrical and Computer Engineering (CCECE). IEEE, 2011. http://dx.doi.org/10.1109/ccece.2011.6030404.

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

Pal, Sudebkumar Prasant, Somesh Kumar, and R. Srikanth. "Multipartite entanglement configurations: Combinatorial offshoots into (hyper)graph theory and their ramifications." In QUANTUM COMPUTING: Back Action 2006. AIP, 2006. http://dx.doi.org/10.1063/1.2400887.

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

Jain, P., and A. M. Agogino. "Optimal Design of Mechanisms Using Simulated Annealing: Theory and Applications." In ASME 1988 Design Technology Conferences. American Society of Mechanical Engineers, 1988. http://dx.doi.org/10.1115/detc1988-0030.

Full text
Abstract:
Abstract A new approach to optimization in kinematic synthesis of mechanisms is presented which is based on simulated annealing, a probabilistic combinatorial optimization technique. The advantage of this technique is that it converges to the global optimum asymptotically. Simulated annealing has been successfully applied to solve several combinatorial optimization problems in the fields of computer-aided design of VLSI chips, image processing and graph theory. However, it has not been used as an optimization tool in the field of mechanical design. We solve three problems in kinematic synthesis using simulated annealing and the results show that the method is fast and obtains solutions at least as good as and in some cases better than those obtained by conventional optimization techniques.
APA, Harvard, Vancouver, ISO, and other styles
7

Klisura, Ðorže. "Embedding Non-planar Graphs: Storage and Representation." In 7th Student Computer Science Research Conference. University of Maribor Press, 2021. http://dx.doi.org/10.18690/978-961-286-516-0.13.

Full text
Abstract:
In this paper, we propose a convention for repre-senting non-planar graphs and their least-crossing embeddings in a canonical way. We achieve this by using state-of-the-art tools such as canonical labelling of graphs, Nauty’s Graph6 string and combinatorial representations for planar graphs. To the best of our knowledge, this has not been done before. Besides, we implement the men-tioned procedure in a SageMath language and compute embeddings for certain classes of cubic, vertex-transitive and general graphs. Our main contribution is an extension of one of the graph data sets hosted on MathDataHub, and towards extending the SageMath codebase.
APA, Harvard, Vancouver, ISO, and other styles
8

Souza, Uéverton, Fábio Protti, Maise Da Silva, and Dieter Rautenbach. "Multivariate Investigation of NP-Hard Problems: Boundaries Between Parameterized Tractability and Intractability." In XXVIII Concurso de Teses e Dissertações da SBC. Sociedade Brasileira de Computação - SBC, 2020. http://dx.doi.org/10.5753/ctd.2015.9996.

Full text
Abstract:
In this thesis we present a multivariate investigation of the complexity of some NP-hard problems, i.e., we first develop a systematic complexity analysis of these problems, defining its subproblems and mapping which one belongs to each side of an “imaginary boundary” between polynomial time solvability and intractability. After that, we analyze which sets of aspects of these problems are sources of their intractability, that is, subsets of aspects for which there exists an algorithm to solve the associated problem, whose non-polynomial time complexity is purely a function of those sets. Thus, we use classical and parameterized complexity in an alternate and complementary approach, to show which subproblems of the given problems are NP-hard and latter to diagnose for which sets of parameters the problems are fixed-parameter tractable, or in FPT. This thesis exhibits a classical and parameterized complexity analysis of different groups of NP-hard problems. The addressed problems are divided into four groups of distinct nature, in the context of data structures, combinatorial games, and graph theory: (I) and/or graph solution and its variants; (II) flooding-filling games; (III) problems on P3-convexity; (IV) problems on induced matchings.
APA, Harvard, Vancouver, ISO, and other styles
9

Rocha, Aleffer, Sheila M. Almeida, and Leandro M. Zatesko. "The Rainbow Connection Number of Triangular Snake Graphs." In Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2020. http://dx.doi.org/10.5753/etc.2020.11091.

Full text
Abstract:
Rainbow coloring problems, of noteworthy applications in Information Security, have been receiving much attention last years in Combinatorics. The rainbow connection number of a graph G is the least number of colors for a (not necessarily proper) edge coloring of G such that between any pair of vertices there is a path whose edge colors are all distinct. In this paper we determine the rainbow connection number of the triple triangular snake graphs.
APA, Harvard, Vancouver, ISO, and other styles
10

Freeman, Jason. "Graph theory." In ACM SIGGRAPH 2008 art gallery. New York, New York, USA: ACM Press, 2008. http://dx.doi.org/10.1145/1400385.1400449.

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

Reports on the topic "Combinatorics – Graph theory – Graph theory"

1

Burch, Kimberly Jordan. Chemical Graph Theory. Washington, DC: The MAA Mathematical Sciences Digital Library, August 2008. http://dx.doi.org/10.4169/loci002857.

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

Thomas, Robin. Graph Minors: Structure Theory and Algorithms. Fort Belvoir, VA: Defense Technical Information Center, January 1993. http://dx.doi.org/10.21236/ada271851.

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

GEORGIA INST OF TECH ATLANTA. Graph Minors: Structure Theory and Algorithms. Fort Belvoir, VA: Defense Technical Information Center, April 1993. http://dx.doi.org/10.21236/ada266033.

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

Obert, James, Sean D. Turner, and Jason Hamlet. Graph Theory and IC Component Design Analysis. Office of Scientific and Technical Information (OSTI), March 2020. http://dx.doi.org/10.2172/1606298.

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

Sweeney, Matthew, and Emily Shinkle. Understanding Discrete Fracture Networks Through Spectral Graph Theory. Office of Scientific and Technical Information (OSTI), August 2021. http://dx.doi.org/10.2172/1812641.

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

Sweeney, Matthew, and Emily Shinkle. Understanding Discrete Fracture Networks Through Spectral Graph Theory. Office of Scientific and Technical Information (OSTI), August 2021. http://dx.doi.org/10.2172/1812622.

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

Horan, Victoria, and Michael Gudaitis. Investigation of Zero Knowledge Proof Approaches Based on Graph Theory. Fort Belvoir, VA: Defense Technical Information Center, February 2011. http://dx.doi.org/10.21236/ada540835.

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

Martin, S. P. The graph representation approach to topological field theory in 2 + 1 dimensions. Office of Scientific and Technical Information (OSTI), February 1991. http://dx.doi.org/10.2172/5812219.

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

Martin, S. P. The graph representation approach to topological field theory in 2 + 1 dimensions. Office of Scientific and Technical Information (OSTI), February 1991. http://dx.doi.org/10.2172/10127500.

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

Mesbahi, Mehran. Dynamic Security and Robustness of Networked Systems: Random Graphs, Algebraic Graph Theory, and Control over Networks. Fort Belvoir, VA: Defense Technical Information Center, February 2012. http://dx.doi.org/10.21236/ada567125.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Combinatorics – Graph theory – Graph theory' for particular source types:
Journal articles Dissertations / Theses Books
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