In discrete mathematics, particularly in graph theory, a graph is a structure consisting of a set of objects where some pairs of the objects are in some...

discrete mathematics include integers, graphs, and statements in logic. By contrast, discrete mathematics excludes topics in "continuous mathematics"...

algebra, analysis, combinatorics, algebraic, differential, discrete and Euclidean geometries, graph theory, group theory, model theory, number theory, set...

up Graph, graph, or -graph in Wiktionary, the free dictionary. Wikimedia Commons has media related to Graphs. Graph may refer to: Graph (discrete mathematics)...

outerplanar graphs", Discrete Mathematics, 26 (1): 47–53, doi:10.1016/0012-365X(79)90060-8. Sysło, Maciej M.; Proskurowski, Andrzej (1983), "On Halin graphs", Graph...

in discrete mathematics. Definitions in graph theory vary. The following are some of the more basic ways of defining graphs and related mathematical structures...

(1985), "On the chromatic number of multiple interval graphs and overlap graphs", Discrete Mathematics, 55 (2): 161–166, doi:10.1016/0012-365X(85)90044-5...

interval graphs", SIAM Journal on Discrete Mathematics, 23 (4): 1905–1953, doi:10.1137/S0895480100373455 Eckhoff, Jürgen (1993), "Extremal interval graphs",...

In the mathematical area of graph theory, a triangle-free graph is an undirected graph in which no three vertices form a triangle of edges. Triangle-free...

Graph pebbling is a mathematical game played on a graph with zero or more pebbles on each of its vertices. 'Game play' is composed of a series of pebbling...

In mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges)...

mathematics, the discrete Laplace operator is an analog of the continuous Laplace operator, defined so that it has meaning on a graph or a discrete grid...

In graph theory, the strong perfect graph theorem is a forbidden graph characterization of the perfect graphs as being exactly the graphs that have neither...

In graph theory, a branch of mathematics, a cluster graph is a graph formed from the disjoint union of complete graphs. Equivalently, a graph is a cluster...

Di Stefano, Gabriele (1999). "Graph classes between parity and distance-hereditary graphs". Discrete Applied Mathematics. 95 (1–3): 197–216. doi:10...

on discrete and combinatorial objects. It started as a part of combinatorics and graph theory, but is now viewed as a branch of applied mathematics and...

Hedetniemi, S. T.; Locke, S. C. (1989), "The subchromatic number of a graph", Discrete Mathematics, 74 (1–2): 33–49, doi:10.1016/0012-365X(89)90196-9. Broersma...

retrieved 2016-09-25. Meyniel, H. (1976), "On the perfect graph conjecture", Discrete Mathematics, 16 (4): 339–342, doi:10.1016/S0012-365X(76)80008-8, MR 0439682...

geometry, combinatorial optimization, digital geometry, discrete differential geometry, geometric graph theory, toric geometry, and combinatorial topology...

In graph theory, a branch of mathematics, many important families of graphs can be described by a finite set of individual graphs that do not belong to...

In the mathematical field of graph theory, a graph G is said to be hypohamiltonian if G itself does not have a Hamiltonian cycle but every graph formed...

In the mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets...

In the mathematical discipline of graph theory, the line graph of an undirected graph G is another graph L(G) that represents the adjacencies between...

time of a graph", Discrete Mathematics, 309 (18): 5588–5595, doi:10.1016/j.disc.2008.04.004, MR 2567962 Gavenčiak, Tomáš (2010), "Cop-win graphs with maximum...

In mathematics, spectral graph theory is the study of the properties of a graph in relationship to the characteristic polynomial, eigenvalues, and eigenvectors...

In graph theory, a branch of mathematics, the kth power Gk of an undirected graph G is another graph that has the same set of vertices, but in which two...

In mathematics, particularly graph theory, and computer science, a directed acyclic graph (DAG) is a directed graph with no directed cycles. That is, it...

property of varying "smoothly", the objects studied in discrete mathematics – such as integers, graphs, and statements in logic – do not vary smoothly in...

In graph theory, a branch of mathematics, a Hamiltonian decomposition of a given graph is a partition of the edges of the graph into Hamiltonian cycles...

Edward R. (1985), "Characterizing intersection classes of graphs", Discrete Mathematics, 55 (2): 185–193, doi:10.1016/0012-365X(85)90047-0, MR 0798535...