Find link

language:

Find link is a tool written by Edward Betts.

searching for Graph (discrete mathematics) 398 found (935 total)

alternate case: graph (discrete mathematics)

Discrete Mathematics (journal) (186 words) [view diff] no match in snippet view article

Discrete Mathematics is a biweekly peer-reviewed scientific journal in the broad area of discrete mathematics, combinatorics, graph theory, and their

Discharging method (discrete mathematics) (1,075 words) [view diff] no match in snippet view article

April 2017), "An introduction to the discharging method via graph coloring", Discrete Mathematics, 340 (4): 766–793, arXiv:1306.4434, doi:10.1016/j.disc.2016

Fulkerson Prize (1,965 words) [view diff] no match in snippet view article find links to article

The Fulkerson Prize for outstanding papers in the area of discrete mathematics is sponsored jointly by the Mathematical Optimization Society (MOS) and

Tomaž Pisanski (1,002 words) [view diff] no match in snippet view article find links to article

mainly in discrete mathematics and graph theory. He is considered by many Slovenian mathematicians to be the "father of Slovenian discrete mathematics." As

Carsten Thomassen (mathematician) (284 words) [view diff] no match in snippet view article

Academy of Sciences and Letters. His research concerns discrete mathematics and more specifically graph theory. Thomassen received his Ph.D. in 1976 from the

Graphs and Combinatorics (205 words) [view diff] no match in snippet view article find links to article

as a second-quartile journal in discrete mathematics and theoretical computer science by SCImago Journal Rank. Graphs and Combinatorics, Springer Science+Business

Triangle-free graph (2,524 words) [view diff] no match in snippet view article find links to article

Sandi; Mulder, Henry Martyn (1999), "Median graphs and triangle-free graphs", SIAM Journal on Discrete Mathematics, 12 (1): 111–118, doi:10.1137/S0895480197323494

David Wood (mathematician) (644 words) [view diff] no match in snippet view article

is discrete mathematics and theoretical computer science, especially structural graph theory, extremal graph theory, geometric graph theory, graph colouring

Circle graph (1,694 words) [view diff] no match in snippet view article find links to article

(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

Inversion (discrete mathematics) (1,905 words) [view diff] no match in snippet view article

In computer science and discrete mathematics, an inversion in a sequence is a pair of elements that are out of their natural order. Let π {\displaystyle

Interval graph (2,640 words) [view diff] no match in snippet view article find links to article

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

DIMACS (253 words) [view diff] no match in snippet view article find links to article

The Center for Discrete Mathematics and Theoretical Computer Science (DIMACS) is a collaboration between Rutgers University, Princeton University, and

Buchholz hydra (1,215 words) [view diff] no match in snippet view article find links to article

In mathematics, especially mathematical logic, graph theory and number theory, the Buchholz hydra game is a type of hydra game, which is a single-player

Dinitz conjecture (423 words) [view diff] no match in snippet view article find links to article

Frédéric (2004). "On the choice number of claw-free perfect graphs". Discrete Mathematics. 276 (1–3): 211–218. doi:10.1016/S0012-365X(03)00292-9. MR 2046636

Douglas West (mathematician) (219 words) [view diff] no match in snippet view article

that includes West. He is the editor of the journal Discrete Mathematics. Introduction to Graph Theory - Second edition, Douglas B. West. Published by

Barnette's conjecture (1,194 words) [view diff] no match in snippet view article find links to article

D. (2000), "Nonhamiltonian 3-connected cubic planar graphs", SIAM Journal on Discrete Mathematics, 13 (1): 25–32, doi:10.1137/S0895480198348665, MR 1737931

Václav Chvátal (1,541 words) [view diff] no match in snippet view article find links to article

and the Canada Research Chair in Discrete Mathematics (2011–2014) till his retirement. Chvátal first learned of graph theory in 1964, on finding a book

Ronald Graham (4,563 words) [view diff] no match in snippet view article find links to article

of the principal architects of the rapid development worldwide of discrete mathematics in recent years". He was president of both the American Mathematical

Oum Sang-il (801 words) [view diff] no match in snippet view article find links to article

(Korean: 엄상일; born 1976) is a South Korean mathematician working in graph theory and discrete mathematics. He is a tenured professor in the Department of Mathematical

Víctor Neumann-Lara (621 words) [view diff] no match in snippet view article find links to article

Miguel A. Pizaña, Thomas Dale Porter "A hierarchy of self-clique graphs" Discrete Mathematics 282(1–3): 193–208 (2004) M. E. Frías-Armenta, Víctor Neumann-Lara

Distance-hereditary graph (2,290 words) [view diff] no match in snippet view article find links to article

In graph theory, a branch of discrete mathematics, a distance-hereditary graph (also called a completely separable graph) is a graph in which the distances

Strongly chordal graph (1,206 words) [view diff] no match in snippet view article find links to article

Graph Classes: A Survey, SIAM Monographs on Discrete Mathematics and Applications, ISBN 0-89871-432-X. Chang, G. J. (1982), K-domination and Graph Covering

Paul A. Catlin (1,724 words) [view diff] no match in snippet view article find links to article

trees". Discrete Mathematics. 309 (5): 1033–1040. doi:10.1016/j.disc.2007.11.056. Paul A. Catlin; Arthur M. Hobbs; Hong-jian Lai (2001). "Graph family

Paul Seymour (mathematician) (2,285 words) [view diff] no match in snippet view article

Seymour FRS is a British mathematician known for his work in discrete mathematics, especially graph theory. He (with others) was responsible for important progress

Discrete Applied Mathematics (185 words) [view diff] no match in snippet view article find links to article

peer-reviewed scientific journal covering algorithmic and applied areas of discrete mathematics. It is published by Elsevier and the editor-in-chief is Endre Boros

Joel Spencer (369 words) [view diff] no match in snippet view article find links to article

Mathematics in 2017, "for contributions to discrete mathematics and theory of computing, particularly random graphs and networks, Ramsey theory, logic, and

Trivially perfect graph (1,189 words) [view diff] no match in snippet view article find links to article

comparability graphs", Discrete Mathematics, 202 (1–3): 33–44, doi:10.1016/S0012-365X(98)00346-X Golumbic, Martin Charles (1978), "Trivially perfect graphs", Discrete

Paul Erdős (5,392 words) [view diff] no match in snippet view article find links to article

of the 20th century. Erdős pursued and proposed problems in discrete mathematics, graph theory, number theory, mathematical analysis, approximation theory

Minimax (3,815 words) [view diff] no match in snippet view article find links to article

Minimax (sometimes Minmax, MM or saddle point) is a decision rule used in artificial intelligence, decision theory, combinatorial game theory, statistics

Bregman–Minc inequality (917 words) [view diff] no match in snippet view article find links to article

In discrete mathematics, the Bregman–Minc inequality, or Bregman's theorem, allows one to estimate the permanent of a binary matrix via its row or column

Crispin Nash-Williams (593 words) [view diff] no match in snippet view article find links to article

mathematician. His research interest was in the field of discrete mathematics, especially graph theory. Nash-Williams was born on 19 December 1932 in Cardiff

Bivariegated graph (450 words) [view diff] no match in snippet view article find links to article

Ranjan N. (1978), "Characterization of 2-variegated graphs and of 3-variegated graphs", Discrete Mathematics, 23: 17–22, doi:10.1016/0012-365X(78)90182-6. Bhat-Nayak

Bivariegated graph (450 words) [view diff] no match in snippet view article find links to article

Ranjan N. (1978), "Characterization of 2-variegated graphs and of 3-variegated graphs", Discrete Mathematics, 23: 17–22, doi:10.1016/0012-365X(78)90182-6. Bhat-Nayak

Indifference graph (1,898 words) [view diff] no match in snippet view article find links to article

probability that a random graph is a unit interval graph, indifference graph, or proper interval graph", Discrete Mathematics, 40 (1): 21–24, doi:10

Brian Alspach (823 words) [view diff] no match in snippet view article find links to article

graphs and digraphs which was published in Discrete Mathematics (February, 1979). He discusses the isomorphism problem for a special class of graphs.

Greedy coloring (3,887 words) [view diff] no match in snippet view article find links to article

"Perfectly orderable graphs", in Berge, Claude; Chvátal, Václav (eds.), Topics in Perfect Graphs, Annals of Discrete Mathematics, vol. 21, Amsterdam:

Perfectly orderable graph (1,149 words) [view diff] no match in snippet view article find links to article

"Perfectly orderable graphs", in Berge, Claude; Chvátal, Václav (eds.), Topics in Perfect Graphs, Annals of Discrete Mathematics, vol. 21, Amsterdam:

Outerplanar graph (2,089 words) [view diff] no match in snippet view article find links to article

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

Peter L. Hammer (569 words) [view diff] no match in snippet view article find links to article

operations research and applied discrete mathematics through the study of pseudo-Boolean functions and their connections to graph theory and data mining. Hammer

Graham Brightwell (248 words) [view diff] no match in snippet view article find links to article

structures; partially ordered sets; algorithms; random graphs; discrete mathematics and graph theory. (Bollobás supervised his PhD on "Linear Extensions

Threshold graph (817 words) [view diff] no match in snippet view article find links to article

of Discrete Mathematics, vol. 1, Amsterdam: North-Holland, pp. 145–162. Golumbic, Martin Charles (1980), Algorithmic Graph Theory and Perfect Graphs, New

Yoshiharu Kohayakawa (275 words) [view diff] no match in snippet view article find links to article

working on discrete mathematics and probability theory. He is known for his work on Szemerédi's regularity lemma, which he extended to sparser graphs. Kohayakawa

Katalin Vesztergombi (395 words) [view diff] no match in snippet view article find links to article

the complete graph,[CQ] and graphons.[D1][D2] With László Lovász and József Pelikán, she is the author of the textbook Discrete Mathematics: Elementary

Strong perfect graph theorem (1,769 words) [view diff] no match in snippet view article find links to article

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

Cop-win graph (3,239 words) [view diff] no match in snippet view article find links to article

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

Katherine Heinrich (554 words) [view diff] no match in snippet view article find links to article

president of the Canadian Mathematical Society. Her research interests include graph theory and the theory of combinatorial designs. Originally from Australia

Graph algebra (622 words) [view diff] no match in snippet view article find links to article

use the methods of graph theory in universal algebra and several other areas of discrete mathematics and computer science. Graph algebras have been used

Outline of combinatorics (683 words) [view diff] no match in snippet view article find links to article

Mathematics Discrete Mathematics Discrete Mathematics & Theoretical Computer Science Discrete Optimization Discussiones Mathematicae Graph Theory Electronic

E. Sampathkumar (342 words) [view diff] no match in snippet view article find links to article

of Discrete Mathematics and Applications. Retrieved 5 February 2025. "The Academy of Discrete Mathematics and Applications". The Academy of Discrete Mathematics

Crossing Numbers of Graphs (469 words) [view diff] no match in snippet view article find links to article

University, and published in 2018 by the CRC Press in their book series Discrete Mathematics and its Applications. The main text of the book has two parts, on

Graph sandwich problem (538 words) [view diff] no match in snippet view article find links to article

Golumbic, Martin Charles (2004), Algorithmic Graph Theory and Perfect Graphs, Annals of Discrete Mathematics, vol. 57 (2nd ed.), Elsevier, p. 279, ISBN 978-0-08-052696-6

Biregular graph (408 words) [view diff] no match in snippet view article find links to article

Edward R.; Ullman, Daniel H. (1997), Fractional graph theory, Wiley-Interscience Series in Discrete Mathematics and Optimization, New York: John Wiley & Sons

Chordal bipartite graph (884 words) [view diff] no match in snippet view article find links to article

chordal graphs", Discrete Mathematics, 43 (2–3): 173–189, doi:10.1016/0012-365X(83)90154-1. Golumbic, Martin Charles (1980), Algorithmic Graph Theory and

Derek Corneil (1,089 words) [view diff] no match in snippet view article find links to article

Stephan; Stewart, Lorna (1997). "Asteroidal Triple-Free Graphs". SIAM Journal on Discrete Mathematics. 10 (3): 399–430. doi:10.1137/S0895480193250125. Arnborg

Distinguishing coloring (1,309 words) [view diff] no match in snippet view article find links to article

1 for asymmetric graphs. Bogstad, Bill; Cowen, Lenore J. (2004), "The distinguishing number of the hypercube", Discrete Mathematics, 283 (1–3): 29–35

Herbert Fleischner (542 words) [view diff] no match in snippet view article find links to article

Graphs and Related Topics: Part 1, Volume 1 (= Annals of Discrete Mathematics Band 45). Elsevier, Juli 1990, ISBN 978-0-444-88395-7. Eulerian Graphs and

Fibonacci cube (1,727 words) [view diff] no match in snippet view article find links to article

Haiyuan (2009), "Fibonacci-like cubes as Z-transformation graphs", Discrete Mathematics, 309 (6): 1284–1293, doi:10.1016/j.disc.2008.01.053, MR 2510538

Erdős–Anning theorem (1,406 words) [view diff] no match in snippet view article find links to article

can also be used to check whether a point set forms an Erdős–Diophantine graph, an inextensible system of integer points with integer distances. The Erdős–Anning

Andreas Brandstädt (469 words) [view diff] no match in snippet view article find links to article

Brandstädt is an active researcher in graph algorithms, discrete mathematics, combinatorial optimization, and graph theory. A frequently used tool in his

Jeannette Janssen (443 words) [view diff] no match in snippet view article find links to article

Mathematics and Statistics, and the chair of the Activity Group on Discrete Mathematics of the Society for Industrial and Applied Mathematics. Janssen earned

Rainer Burkard (273 words) [view diff] no match in snippet view article find links to article

His research interests include discrete optimization, graph theory, applied discrete mathematics, and applied number theory. He earned his Ph.D. from the

Graph power (1,260 words) [view diff] no match in snippet view article find links to article

Kramer, Horst (2008), "A survey on the distance-colouring of graphs", Discrete Mathematics, 308 (2–3): 422–426, doi:10.1016/j.disc.2006.11.059, MR 2378044

Vladimir Batagelj (656 words) [view diff] no match in snippet view article find links to article

mathematics at the University of Ljubljana. He is known for his work in discrete mathematics and combinatorial optimization, particularly analysis of social networks

SIAM Journal on Matrix Analysis and Applications (128 words) [view diff] no match in snippet view article find links to article

and Discrete Methods in 1980, until it split into SIAM Journal on Discrete Mathematics and the current title in 1988. The journal is published by the Society

Connected dominating set (1,239 words) [view diff] no match in snippet view article find links to article

analysis for finding a k-leaf spanning tree in an undirected graph", Discrete Mathematics & Theoretical Computer Science, 16 (1): 179–200, MR 3188035.

Halin graph (2,300 words) [view diff] no match in snippet view article find links to article

Halin graphs and their exterior contractions", in Alspach, Brian R.; Godsil, Christopher D. (eds.), Cycles in Graphs, Annals of Discrete Mathematics, vol

Julius Petersen (1,477 words) [view diff] no match in snippet view article find links to article

(1992) 83–97. H. Mulder., Julius Petersen's theory of regular graphs., Discrete Mathematics 100 (1992) 157–175 O'Connor, John J.; Robertson, Edmund F.,

Adjacent-vertex-distinguishing-total coloring (777 words) [view diff] no match in snippet view article find links to article

adjacent vertex distinguishing total coloring numbers of graphs with Delta=3". Discrete Mathematics. 308 (17): 4003–4007. doi:10.1016/j.disc.2007.07.091.

Erdős–Gallai theorem (1,248 words) [view diff] no match in snippet view article find links to article

Triesch, Eberhard (1994), "Realizability and uniqueness in graphs", Discrete Mathematics, 136 (1–3): 3–20, doi:10.1016/0012-365X(94)00104-Q, MR 1313278

Michael D. Plummer (442 words) [view diff] no match in snippet view article find links to article

MR 0289347. Plummer, M. D. (1980), "On n-extendable graphs", Discrete Mathematics, 31 (2): 201–210, doi:10.1016/0012-365X(80)90037-0, MR 0583220. Books

List coloring (1,619 words) [view diff] no match in snippet view article find links to article

S2CID 45528500 Gutner, Shai (1996), "The complexity of planar graph choosability", Discrete Mathematics, 159 (1): 119–130, arXiv:0802.2668, doi:10.1016/0012-365X(95)00104-5

Mike Paterson (654 words) [view diff] no match in snippet view article find links to article

British computer scientist, who was the director of the Centre for Discrete Mathematics and its Applications (DIMAP) at the University of Warwick until 2007

Ellingham–Horton graph (444 words) [view diff] no match in snippet view article find links to article

MathWorld. Tutte, W. T. (1971), "On the 2-factors of bicubic graphs", Discrete Mathematics, 1 (2): 203–208, doi:10.1016/0012-365X(71)90027-6. Jessica Wolz

Component (graph theory) (3,443 words) [view diff] no match in snippet view article

258–259, MR 0100850 Chvátal, Václav (1973), "Tough graphs and Hamiltonian circuits", Discrete Mathematics, 5 (3): 215–228, doi:10.1016/0012-365X(73)90138-6

Zdzisław Skupień (214 words) [view diff] no match in snippet view article find links to article

2025) was a Polish mathematician, expert in optimization, discrete mathematics, and graph theory, academic, and dr. hab. (1982). Skupień was born in

Comparability graph (1,398 words) [view diff] no match in snippet view article find links to article

Andreas; Le, Van Bang; Spinrad, Jeremy (1999), Graph Classes: A Survey, SIAM Monographs on Discrete Mathematics and Applications, ISBN 0-89871-432-X. Chartrand

Snark (graph theory) (2,760 words) [view diff] no match in snippet view article

International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, Electronic Notes in Discrete Mathematics, vol. 28, pp. 417–424, doi:10.1016/j

Maria Chudnovsky (784 words) [view diff] no match in snippet view article find links to article

Henri (2009), "The strong perfect graph conjecture: 40 years of attempts, and its resolution", Discrete Mathematics, 309 (20): 6092–6113, CiteSeerX 10

Hamiltonian decomposition (1,763 words) [view diff] no match in snippet view article find links to article

colourable graphs", Advances in graph theory (Cambridge Combinatorial Conf., Trinity College, Cambridge, 1977), Annals of Discrete Mathematics, vol. 3,

Snake-in-the-box (1,581 words) [view diff] no match in snippet view article find links to article

bounds for the snake-in-the-box problem include proofs using discrete mathematics and graph theory, exhaustive search of the search space, and heuristic

Michael Dinneen (292 words) [view diff] no match in snippet view article find links to article

Center for Discrete Mathematics and Theoretical Computer Science. He does research in combinatorial optimization, distributed computing, and graph theory

Hypertree (622 words) [view diff] no match in snippet view article find links to article

Andreas; Le, Van Bang; Spinrad, Jeremy (1999), Graph Classes: A Survey, SIAM Monographs on Discrete Mathematics and Applications, ISBN 0-89871-432-X, MR 1686154

Joan Hutchinson (882 words) [view diff] no match in snippet view article find links to article

of Graph Theory since 1993. Her research has focused on graph theory and discrete mathematics, specializing mainly in topological and chromatic graph theory

Mihyun Kang (261 words) [view diff] no match in snippet view article find links to article

including graph enumeration and the topological properties of random graphs. She is a professor in the Institute of Discrete Mathematics at the Graz

S. L. Hakimi (587 words) [view diff] no match in snippet view article find links to article

Havel–Hakimi theorem", How to Count: An Introduction to Combinatorics, Discrete Mathematics and Its Applications (2nd ed.), CRC Press, p. 159, ISBN 9781420082616

Dominique de Caen (972 words) [view diff] no match in snippet view article find links to article

(1998). "An upper bound on the sum of squares of degrees in a graph". Discrete Mathematics. 185 (1–3): 245–248. doi:10.1016/S0012-365X(97)00213-6. Dominique

Haruo Hosoya (321 words) [view diff] no match in snippet view article find links to article

University, Tokyo, Japan. He is the namesake of the Hosoya index used in discrete mathematics and computational chemistry. Hosoya was born in Kamakura, Japan to

Pancake sorting (2,201 words) [view diff] no match in snippet view article find links to article

Papadimitriou, C. (1979). "Bounds for Sorting by Prefix Reversal". Discrete Mathematics. 27: 47–57. doi:10.1016/0012-365X(79)90068-2. "Team Bests Young Bill

Sphericity (graph theory) (446 words) [view diff] no match in snippet view article

Hiroshi (1986-03-01). "On the sphericity of the graphs of semiregular polyhedra". Discrete Mathematics. 58 (3): 311–315. doi:10.1016/0012-365X(86)90150-0

Lorna Stewart (272 words) [view diff] no match in snippet view article find links to article

Stewart, Lorna (1993), "Domination on cocomparability graphs", SIAM Journal on Discrete Mathematics, 6 (3): 400–417, doi:10.1137/0406032, MR 1229694, Zbl 0780

Arborescence (graph theory) (782 words) [view diff] no match in snippet view article

(2013). Graphs Theory and Applications: With Exercises and Problems. John Wiley & Sons. pp. 94–95. ISBN 978-1-84821-070-7. Jean Gallier (2011). Discrete Mathematics

Boxicity (1,554 words) [view diff] no match in snippet view article find links to article

Przytycka, Teresa; Whitesides, Sue (1993), "Grid intersection graphs and boxicity", Discrete Mathematics, 114 (1–3): 41–49, doi:10.1016/0012-365X(93)90354-V. Berman

Erdős–Ko–Rado theorem (5,592 words) [view diff] no match in snippet view article find links to article

(2016), "Removal and stability for Erdős–Ko–Rado", SIAM Journal on Discrete Mathematics, 30 (2): 1102–1114, doi:10.1137/15M105149X, MR 3504983 Deza, Michel;

Incidence poset (423 words) [view diff] no match in snippet view article find links to article

"The maximum number of edges in a graph of bounded dimension, with applications to ring theory", Discrete Mathematics, 201 (1–3): 5–19, doi:10.1016/S0012-365X(98)00309-4

Median graph (6,003 words) [view diff] no match in snippet view article find links to article

Sandi; Mulder, Henry Martyn (1999), "Median graphs and triangle-free graphs", SIAM Journal on Discrete Mathematics, 12 (1): 111–118, CiteSeerX 10.1.1.28.5906

Gregory Gutin (251 words) [view diff] no match in snippet view article find links to article

17 January 1957) is a scholar in theoretical computer science and discrete mathematics. He received his PhD in Mathematics in 1993 from Tel Aviv University

Universal vertex (1,942 words) [view diff] no match in snippet view article find links to article

serial graphs", Discrete Mathematics, 282 (1–3): 183–191, doi:10.1016/j.disc.2003.10.023, MR 2059518. Bonato, Anthony (2008), A course on the web graph, Graduate

Dually chordal graph (873 words) [view diff] no match in snippet view article find links to article

in Intersection Graph Theory, SIAM Monographs on Discrete Mathematics and Applications. Moscarini, Marina (1993), "Doubly Chordal Graphs, Steiner trees

Lexicographic breadth-first search (1,729 words) [view diff] no match in snippet view article find links to article

Andreas; Le, Van Bang; Spinrad, Jeremy (1999), Graph Classes: A Survey, SIAM Monographs on Discrete Mathematics and Applications, ISBN 0-89871-432-X. Bretscher

Claude Berge (2,396 words) [view diff] no match in snippet view article find links to article

perfect graph conjecture", Discrete Mathematics, 2 (3): 253–267, doi:10.1016/0012-365X(72)90006-4. —— (1972b), "A characterization of perfect graphs", Journal

Balanced hypergraph (1,293 words) [view diff] no match in snippet view article find links to article

L. (1972-06-01). "Normal hypergraphs and the perfect graph conjecture". Discrete Mathematics. 2 (3): 253–267. doi:10.1016/0012-365X(72)90006-4. ISSN 0012-365X

Handshaking lemma (3,598 words) [view diff] no match in snippet view article find links to article

colourable graphs", Advances in Graph Theory (Cambridge Combinatorial Conf., Trinity College, Cambridge, 1977), Annals of Discrete Mathematics, vol. 3,

János Pach (1,304 words) [view diff] no match in snippet view article find links to article

journals including Combinatorica, SIAM Journal on Discrete Mathematics, Computational Geometry, Graphs and Combinatorics, Central European Journal of Mathematics

Jaroslav Nešetřil (726 words) [view diff] no match in snippet view article find links to article

in discrete mathematics at Charles University”. Scholia has a profile for Jaroslav Nešetřil (Q956806). Hell, Pavol; Nešetřil, Jaroslav (2004). Graphs and

Grötzsch graph (980 words) [view diff] no match in snippet view article find links to article

Simonovits, M. (1973), "On a valence problem in extremal graph theory", Discrete Mathematics, 5 (4): 323–334, doi:10.1016/0012-365X(73)90126-X, MR 0342429

Grundy number (1,355 words) [view diff] no match in snippet view article find links to article

graphs", Discrete Mathematics, 306 (23): 3166–3173, doi:10.1016/j.disc.2005.06.044, MR 2273147. Johnson, D. S. (1974), "Worst-case behavior of graph coloring

Dénes Kőnig (796 words) [view diff] no match in snippet view article find links to article

Mathematics Activity Group on Discrete Mathematics to an early career researcher for outstanding research in an area of discrete mathematics. The first award was

Linear function (652 words) [view diff] no match in snippet view article find links to article

Programming", in Leslie Hogben, ed., Handbook of Linear Algebra, Discrete Mathematics and Its Applications, Chapman and Hall/CRC, chap. 50. ISBN 1-584-88510-6

Martin Aigner (517 words) [view diff] no match in snippet view article find links to article

in Enumeration, 2007, ISBN 3-540-39032-4 Aigner, Martin (2007). Discrete mathematics. Providence, R.I.: American Mathematical Society. ISBN 978-0-8218-4151-8

Gallai–Hasse–Roy–Vitaver theorem (1,869 words) [view diff] no match in snippet view article find links to article

"Theorem 7.17 (The Gallai–Roy–Vitaver Theorem)", Chromatic Graph Theory, Discrete Mathematics and its Applications, Boca Raton, Florida: CRC Press, ISBN 978-1-58488-800-0

Burr–Erdős conjecture (859 words) [view diff] no match in snippet view article find links to article

MR 0714447. Eaton, Nancy (1998), "Ramsey numbers for sparse graphs", Discrete Mathematics, 185 (1–3): 63–75, doi:10.1016/S0012-365X(97)00184-2, MR 1614289

Petersen's theorem (1,479 words) [view diff] no match in snippet view article find links to article

Johansson, Robert (2004), "A note on edge-decompositions of planar graphs", Discrete Mathematics, 283 (1–3): 263–266, doi:10.1016/j.disc.2003.11.017, MR 2061501

Hajós construction (1,470 words) [view diff] no match in snippet view article find links to article

high edge density", Discrete Mathematics, 98 (2): 147–151, doi:10.1016/0012-365X(91)90039-5, MR 1144633. Kubale, Marek (2004), Graph Colorings, Contemporary

Claw-free graph (3,989 words) [view diff] no match in snippet view article find links to article

Flandrin, Evelyne; Ryjáček, Zdeněk (1997), "Claw-free graphs — A survey", Discrete Mathematics, 164 (1–3): 87–147, doi:10.1016/S0012-365X(96)00045-3,

Oberwolfach problem (1,464 words) [view diff] no match in snippet view article find links to article

mathematics For which 2-regular n {\displaystyle n} -vertex graphs G {\displaystyle G} can the complete graph K n {\displaystyle K_{n}} be decomposed into edge-disjoint

Caterpillar tree (1,205 words) [view diff] no match in snippet view article find links to article

Andrzej; Telle, Jan Arne (1999), "Classes of graphs with restricted interval models" (PDF), Discrete Mathematics and Theoretical Computer Science, 3: 167–176

Jacob Fox (438 words) [view diff] no match in snippet view article find links to article

Society for Industrial and Applied Mathematics Activity Group on Discrete Mathematics. He was an invited speaker at the International Congress of Mathematicians

Turán graph (1,262 words) [view diff] no match in snippet view article find links to article

Chao, C. Y.; Novacky, G. A. (1982). "On maximally saturated graphs". Discrete Mathematics. 41 (2): 139–143. doi:10.1016/0012-365X(82)90200-X. Falls, Craig;

Line graph (5,368 words) [view diff] no match in snippet view article find links to article

graph and voltage-current duality", Discrete Mathematics, 104 (2): 111–141, doi:10.1016/0012-365X(92)90328-D, MR 1172842. McKee, T. A. (1989), "Graph-theoretic

János Komlós (mathematician) (770 words) [view diff] no match in snippet view article

Hungarian-American mathematician, working in probability theory and discrete mathematics. He has been a professor of mathematics at Rutgers University since

Gabriel Andrew Dirac (468 words) [view diff] no match in snippet view article find links to article

Thomassen, B. Toft, and P. Vestergaard (eds.), Graph Theory in Memory of G.A. Dirac, Annals of Discrete Mathematics, volume 41, North-Holland, 1989. ISBN 0-444-87129-2

Rado's theorem (Ramsey theory) (606 words) [view diff] no match in snippet view article

system of linear equations is regular is also an NP-complete problem. Modern graph theory by Béla Bollobás. 1st ed. 1998. ISBN 978-0-387-98488-9. Page 204

Antimatroid (4,947 words) [view diff] no match in snippet view article find links to article

European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2009), Electronic Notes in Discrete Mathematics, vol. 34, pp. 9–13, doi:10.1016/j

Reconfiguration (1,182 words) [view diff] no match in snippet view article find links to article

In discrete mathematics and theoretical computer science, reconfiguration problems are computational problems involving reachability or connectivity of

T-theory (256 words) [view diff] no match in snippet view article find links to article

T-theory is a branch of discrete mathematics dealing with analysis of trees and discrete metric spaces. T-theory originated from a question raised by Manfred

Apollonian network (4,752 words) [view diff] no match in snippet view article find links to article

proceedings of the Conference on Convexity and Graph Theory, Israel, March 1981, Annals of Discrete Mathematics 20, North-Holland Mathematical Studies 87,

Jo Ellis-Monaghan (333 words) [view diff] no match in snippet view article find links to article

positions at the University of Vermont. In 2020, she became professor of Discrete Mathematics at the University of Amsterdam. From 2010-2020, she served as a subject

Robbins' theorem (1,040 words) [view diff] no match in snippet view article find links to article

"Characterization of strongly orientable graphs", Graph Theory and its Applications, Discrete Mathematics and its Applications (2nd ed.), Boca Raton

Fred S. Roberts (505 words) [view diff] no match in snippet view article find links to article

center concept". In 2003, DIMACS held a Conference on Applications of Discrete Mathematics and Theoretical Computer Science, in honor of Roberts' 60th birthday

Woodall's conjecture (621 words) [view diff] no match in snippet view article find links to article

(PDF), Discrete Mathematics, 32 (2): 213–215, doi:10.1016/0012-365X(80)90057-6, MR 0592858 Lovász, László (1976), "On two minimax theorems in graph", Journal

Tree (graph theory) (3,385 words) [view diff] no match in snippet view article

trees", Discrete Mathematics, 88 (1): 93–104, doi:10.1016/0012-365X(91)90061-6, MR 1099270. Wikimedia Commons has media related to Tree (graph theory)

Möbius–Kantor graph (1,599 words) [view diff] no match in snippet view article find links to article

Contributions to Discrete Mathematics, 4 (1): 21–39, MR 2541986. Lijnen, Erwin; Ceulemans, Arnout (2004), "Oriented 2-Cell Embeddings of a Graph and Their Symmetry

Sarah-marie belcastro (1,133 words) [view diff] no match in snippet view article find links to article

(2015). "Triangle-free uniquely 3-edge colorable cubic graphs". Contributions to Discrete Mathematics. 10 (2): 39–44. arXiv:1508.06934. doi:10.11575/cdm.v10i2

George J. Minty (1,102 words) [view diff] no match in snippet view article find links to article

American mathematician, specializing in mathematical analysis and discrete mathematics. He is known for the Klee–Minty cube, the Browder–Minty theorem,

Schnyder's theorem (630 words) [view diff] no match in snippet view article find links to article

In graph theory, Schnyder's theorem is a characterization of planar graphs in terms of the order dimension of their incidence posets. It is named after

Ralph Gordon Stanton (992 words) [view diff] no match in snippet view article find links to article

As a researcher, he made important contributions in the area of discrete mathematics; and as an educator and administrator, was also instrumental in founding

Even-hole-free graph (727 words) [view diff] no match in snippet view article find links to article

Vušković, Kristina (2010), "Even-hole-free graphs: a survey" (PDF), Applicable Analysis and Discrete Mathematics, 4 (2): 219–240, doi:10.2298/AADM100812027V

Dieter Jungnickel (414 words) [view diff] no match in snippet view article find links to article

Jungnickel joined Augsburg University where he occupies the chair for discrete mathematics, optimisation, and operations research. Jungnickel wrote about finite

Well-colored graph (444 words) [view diff] no match in snippet view article find links to article

Pierre; Kuplinsky, Julio (1991), "The smallest hard-to-color graph", Discrete Mathematics, 96 (3): 199–212, doi:10.1016/0012-365X(91)90313-Q, MR 1139447

Nathaniel Dean (mathematician) (1,046 words) [view diff] no match in snippet view article

Joseph; Franzblau, Deborah; Roberts, Fred (1997). Discrete Mathematics in the Schools. Discrete Mathematics and Theoretical Computer Science. Vol. 36 (1 ed

Chordal graph (2,164 words) [view diff] no match in snippet view article find links to article

path graphs", SIAM Journal on Discrete Mathematics, 7 (2): 331–336, doi:10.1137/s0895480191223191, hdl:11422/1497. Information System on Graph Class

András Hajnal (1,913 words) [view diff] no match in snippet view article find links to article

Discrete Mathematics, 308 (19): 4337–4360, doi:10.1016/j.disc.2007.08.019, MR 2433861 Erdős, P.; Hajnal, A.; Moon, J. W. (1964), "A problem in graph theory"

Svatopluk Poljak (366 words) [view diff] no match in snippet view article find links to article

diverse areas of discrete mathematics, including matroid theory, matching theory, the max-cut and stable set problems, spectral graph theory, convex and

Radius (1,199 words) [view diff] no match in snippet view article find links to article

Andrew M. Gleason (ed.). Advanced Mathematics: Precalculus with Discrete Mathematics and Data Analysis. Evanston, Illinois: McDougal Littell. ISBN 0-395-77114-5

List of unsolved problems in mathematics (20,120 words) [view diff] no match in snippet view article find links to article

conjecture holds for the product of a graph and a sufficiently large complete bipartite graph". Discrete Mathematics, Algorithms and Applications. 11 (6):

Well-covered graph (3,372 words) [view diff] no match in snippet view article find links to article

Peter J. (1993), "A note on well-covered graphs", Quo vadis, graph theory?, Annals of Discrete Mathematics, vol. 55, Amsterdam: North-Holland, pp. 179–181

Svatopluk Poljak (366 words) [view diff] no match in snippet view article find links to article

diverse areas of discrete mathematics, including matroid theory, matching theory, the max-cut and stable set problems, spectral graph theory, convex and

Circular-arc graph (866 words) [view diff] no match in snippet view article find links to article

"LLT polynomials, chromatic quasisymmetric functions and graphs with cycles". Discrete Mathematics. 341 (12): 3453–3482. arXiv:1705.10353. doi:10.1016/j

(a, b)-decomposition (810 words) [view diff] no match in snippet view article

Qijun (2011). "Decomposing a planar graph with girth at least 8 into a forest and a matching". Discrete Mathematics. 311 (10–11): 844–849. doi:10.1016/j

Pancyclic graph (1,638 words) [view diff] no match in snippet view article find links to article

Halin graphs and their exterior contractions", in Alspach, Brian R.; Godsil, Christopher D. (eds.), Cycles in Graphs, Annals of Discrete Mathematics, vol

Kőnig's theorem (graph theory) (3,433 words) [view diff] no match in snippet view article

in Discrete Mathematics and Optimization, vol. 33, John Wiley & Sons, pp. 48–49, ISBN 9781118031391. Bondy, J. A.; Murty, U. S. R. (1976), Graph Theory

Béla Andrásfai (480 words) [view diff] no match in snippet view article find links to article

Mathematical Sciences. Designer and subject lecturer of the course Discrete Mathematics. At the invitation of the Mathematical Institute of the Eötvös Loránd

Maya Stein (382 words) [view diff] no match in snippet view article find links to article

Innovations in Graph Theory Editor-in-Chief for Electronic Journal of Combinatorics Associate editor for SIAM Journal on Discrete Mathematics Associate editor

2-factor theorem (504 words) [view diff] no match in snippet view article find links to article

Mulder, H. (1992), "Julius Petersen's theory of regular graphs", Discrete Mathematics, 100 (1–3): 157–175, doi:10.1016/0012-365X(92)90639-W. Lützen

Conway's 99-graph problem (709 words) [view diff] no match in snippet view article find links to article

of strongly regular graphs with parameters λ = 1 {\displaystyle \lambda =1} , μ = 2 {\displaystyle \mu =2} ", Discrete Mathematics and Applications, 14

Lajos Pósa (mathematician) (1,269 words) [view diff] no match in snippet view article

Amsterdam, 1975, 585-595. L. Pósa: Hamiltonian circuits in random graphs, Discrete Mathematics, 14 (1976), 359-364. Pósa Lajos: Véletlen gráfok Hamilton körei

Clique-sum (1,178 words) [view diff] no match in snippet view article find links to article

completable graphs", Discrete Mathematics, 159 (1–3): 155–160, doi:10.1016/0012-365X(95)00107-8, MR 1415290. Lovász, László (2006), "Graph minor theory"

Perfect graph theorem (1,594 words) [view diff] no match in snippet view article find links to article

Lovász, László (1972a), "Normal hypergraphs and the perfect graph conjecture", Discrete Mathematics, 2 (3): 253–267, doi:10.1016/0012-365X(72)90006-4. Lovász

Closure problem (1,622 words) [view diff] no match in snippet view article find links to article

In graph theory and combinatorial optimization, a closure of a directed graph is a set of vertices C, such that no edges leave C. The closure problem is

Complete bipartite graph (960 words) [view diff] no match in snippet view article find links to article

ISBN 9783642322785. Jensen, Tommy R.; Toft, Bjarne (2011), Graph Coloring Problems, Wiley Series in Discrete Mathematics and Optimization, vol. 39, Wiley, p. 16, ISBN 9781118030745

Fixed-point theorem (1,278 words) [view diff] no match in snippet view article find links to article

and thus must have a fixed point. This is clear when examining a sketched graph of the cosine function; the fixed point occurs where the cosine curve y

End (graph theory) (3,112 words) [view diff] no match in snippet view article

Diestel, Reinhard (1992), "The end structure of a graph: recent results and open problems", Discrete Mathematics, 100 (1–3): 313–327, doi:10.1016/0012-365X(92)90650-5

Loupekine snark (481 words) [view diff] no match in snippet view article find links to article

Gordon I. (2024), "Rotationally symmetric snarks from voltage graphs", Discrete Mathematics, 347 (4): Paper No. 113874, 15, doi:10.1016/j.disc.2024.113874

Pseudoforest (4,054 words) [view diff] no match in snippet view article find links to article

G. E. (1988), "Parallel symmetry-breaking in sparse graphs", SIAM Journal on Discrete Mathematics, 1 (4): 434–446, doi:10.1137/0401044. Konyagin, Sergei;

Jack Edmonds (1,543 words) [view diff] no match in snippet view article find links to article

fields of combinatorial optimization, polyhedral combinatorics, discrete mathematics and the theory of computing. He was the recipient of the 1985 John

Grinberg's theorem (1,161 words) [view diff] no match in snippet view article find links to article

"Non-Hamiltonian non-Grinbergian graphs", Discrete Mathematics, 17 (3): 317–321, doi:10.1016/0012-365X(77)90165-0, MR 0460189 Grinberg Graphs, from MathWorld.

Mathematical chemistry (570 words) [view diff] no match in snippet view article find links to article

chemistry. Major areas of research in mathematical chemistry include chemical graph theory, which deals with topology such as the mathematical study of isomerism

Möbius ladder (1,383 words) [view diff] no match in snippet view article find links to article

ladder". Discrete Mathematics. 184 (1–3): 137–164. doi:10.1016/S0012-365X(97)00086-1. MR 1609294. De Mier, Anna; Noy, Marc (2004). "On graphs determined

Linear extension (1,494 words) [view diff] no match in snippet view article find links to article

Martin (1999), "Faster random generation of linear extensions", Discrete Mathematics, 201 (1–3): 81–88, doi:10.1016/S0012-365X(98)00333-1, S2CID 2942330

Steiner tree problem (4,416 words) [view diff] no match in snippet view article find links to article

Jaroslav (2001), "Vojtěch Jarnik's work in combinatorial optimization", Discrete Mathematics, 235 (1–3): 1–17, doi:10.1016/S0012-365X(00)00256-9, hdl:10338.dmlcz/500662

Collaboration graph (1,056 words) [view diff] no match in snippet view article find links to article

Graph theory – Area of discrete mathematics Odda, Tom (1979). "On properties of a well-known graph or what is your Ramsey number? Topics in graph theory"

Gary Chartrand (470 words) [view diff] no match in snippet view article find links to article

Linda Lesniak and Ping Zhang) Graphs & Digraphs, 5th edition, CRC Press MR2766107. 2010: (with Ping Zhang) Discrete Mathematics, Waveland Press. 2012: (with

Egon Zakrajšek (344 words) [view diff] no match in snippet view article find links to article

sciences, statistics, mechanics, classical applied mathematics, discrete mathematics, graph and network theory, linear programming, operational researches

Wheel graph (589 words) [view diff] no match in snippet view article find links to article

Paley graph nor its complement contains a copy of K4. Weisstein, Eric W. "Wheel Graph". MathWorld. Rosen, Kenneth H. (2011). Discrete Mathematics and Its

Polyhedral graph (850 words) [view diff] no match in snippet view article find links to article

Owens, Peter J. (1999), "Shortness parameters for polyhedral graphs", Discrete Mathematics, 206 (1–3): 159–169, doi:10.1016/S0012-365X(98)00402-6, MR 1665396

Hedetniemi's conjecture (1,853 words) [view diff] no match in snippet view article find links to article

Combinatorics and More. Klavžar, Sandi (1996), "Coloring graph products: a survey", Discrete Mathematics, 155 (1–3): 135–145, doi:10.1016/0012-365X(94)00377-U

Rigidity matroid (2,242 words) [view diff] no match in snippet view article find links to article

freedom of an undirected graph with rigid edges of fixed lengths, embedded into Euclidean space. In a rigidity matroid for a graph with n vertices in d-dimensional

Svante Janson (1,139 words) [view diff] no match in snippet view article find links to article

Łuczak, Tomasz; Rucinski, Andrzej (2000). Random graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization. New York: Wiley-Interscience

Graph enumeration (554 words) [view diff] no match in snippet view article find links to article

Frank; Schwenk, Allen J. (1973), "The number of caterpillars" (PDF), Discrete Mathematics, 6 (4): 359–365, doi:10.1016/0012-365x(73)90067-8, hdl:2027.42/33977

Mehdi Behzad (1,189 words) [view diff] no match in snippet view article find links to article

(2008). "On the domination number of the generalized Petersen graphs". Discrete Mathematics. 308 (4): 603–610. doi:10.1016/j.disc.2007.03.024. Behzad, Arash;

Svante Janson (1,139 words) [view diff] no match in snippet view article find links to article

Łuczak, Tomasz; Rucinski, Andrzej (2000). Random graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization. New York: Wiley-Interscience

Radio coloring (638 words) [view diff] no match in snippet view article find links to article

R.; Yeh, Roger K. (1992), "Labelling graphs with a condition at distance 2", SIAM Journal on Discrete Mathematics, 5 (4): 586–595, doi:10.1137/0405048

Reinhard Diestel (402 words) [view diff] no match in snippet view article find links to article

in graph theory, including the interplay among graph minors, matroid theory, tree decomposition, and infinite graphs. He holds the chair of discrete mathematics

V. J. Havel (121 words) [view diff] no match in snippet view article find links to article

Havel–Hakimi theorem", How to Count: An Introduction to Combinatorics, Discrete Mathematics and Its Applications (2nd ed.), CRC Press, p. 159, ISBN 9781420082616

Wolfram (software) (1,749 words) [view diff] no match in snippet view article

basis of the Combinatorica package, which adds discrete mathematics functionality in combinatorics and graph theory to the program. Communication with other

Wiener index (1,871 words) [view diff] no match in snippet view article find links to article

Gutman, Ivan (1994), "On the sum of all distances in composite graphs", Discrete Mathematics, 135 (1–3): 359–365, doi:10.1016/0012-365X(93)E0092-I, MR 1310892

András Sebő (563 words) [view diff] no match in snippet view article find links to article

mathematician working in the areas of combinatorial optimization and discrete mathematics. Sebő is a French National Centre for Scientific Research (CNRS)

Split (graph theory) (1,328 words) [view diff] no match in snippet view article

In graph theory, a split of an undirected graph is a cut whose cut-set forms a complete bipartite graph. A graph is prime if it has no splits. The splits

Levi graph (601 words) [view diff] no match in snippet view article find links to article

In combinatorial mathematics, a Levi graph or incidence graph is a bipartite graph associated with an incidence structure. From a collection of points

Dilworth's theorem (2,445 words) [view diff] no match in snippet view article find links to article

Lovász, László (1972), "Normal hypergraphs and the perfect graph conjecture", Discrete Mathematics, 2 (3): 253–267, doi:10.1016/0012-365X(72)90006-4. Mirsky

Mathematics (15,943 words) [view diff] no match in snippet view article find links to article

and other parts of discrete mathematics. For example, discrete geometry includes counting configurations of geometric shapes. Graph theory and hypergraphs

John Truss (1,358 words) [view diff] no match in snippet view article find links to article

lastly joining the University of Leeds. He has written books on discrete mathematics (1991) and mathematical analysis (1997) and was co-editor in chief

Moser spindle (1,530 words) [view diff] no match in snippet view article find links to article

(1989), "Minimax relations for the partial q-colorings of a graph", Discrete Mathematics, 74 (1–2): 3–14, doi:10.1016/0012-365X(89)90193-3, MR 0989117

Erdős–Szemerédi theorem (2,731 words) [view diff] no match in snippet view article find links to article

"The sum-product phenomenon in arbitrary rings", Contributions to Discrete Mathematics, 4 (2): 59–82, arXiv:0806.2497, Bibcode:2008arXiv0806.2497T, doi:10

Star (graph theory) (743 words) [view diff] no match in snippet view article

Flandrin, Evelyne; Ryjáček, Zdeněk (1997), "Claw-free graphs — A survey", Discrete Mathematics, 164 (1–3): 87–147, doi:10.1016/S0012-365X(96)00045-3,

Floyd–Warshall algorithm (3,017 words) [view diff] no match in snippet view article find links to article

ISBN 9783031799839. Gross, Jonathan L.; Yellen, Jay (2003). Handbook of Graph Theory. Discrete Mathematics and Its Applications. CRC Press. p. 65. ISBN 9780203490204

Steven Skiena (719 words) [view diff] no match in snippet view article find links to article

Sriram; Skiena, Steven (15 October 2009). Computational Discrete Mathematics: Combinatorics and Graph Theory with Mathematics (1st ed.). Cambridge University

Daniel Kleitman (860 words) [view diff] no match in snippet view article find links to article

Peck, G. W. (2002). "Kleitman and Combinatorics: A Celebration". Discrete Mathematics. 257 (2–3): 193–224. doi:10.1016/S0012-365X(02)00595-2. MR 1935723

Treewidth (4,569 words) [view diff] no match in snippet view article find links to article

In graph theory, the treewidth of an undirected graph is an integer number which specifies, informally, how far the graph is from being a tree. The smallest

Deficiency (graph theory) (1,145 words) [view diff] no match in snippet view article

Ralf (2018-10-01). "Hall's and Kőnig's theorem in graphs and hypergraphs". Discrete Mathematics. 341 (10): 2753–2761. doi:10.1016/j.disc.2018.06.013

Periodic graph (crystallography) (2,541 words) [view diff] no match in snippet view article

Periodic Graphs" (PDF), DIMACS Series in Discrete Mathematics and Theoretical Computer Science 4: Applied Geometry and Discrete Mathematics, DIMACS Series

Scheinerman's conjecture (822 words) [view diff] no match in snippet view article find links to article

I. B.-A.; Newman, I.; Ziv, R. (1991), "On grid intersection graphs", Discrete Mathematics, 87 (1): 41–52, doi:10.1016/0012-365X(91)90069-E, MR 1090188

Sachs subgraph (338 words) [view diff] no match in snippet view article find links to article

Heping (2017), "On the permanental polynomials of graphs", Graph Polynomials, Discrete Mathematics and its Applications, Boca Raton, Florida: CRC Press

K-tree (486 words) [view diff] no match in snippet view article find links to article

In graph theory, a k-tree is an undirected graph formed by starting with a (k + 1)-vertex complete graph and then repeatedly adding vertices in such a

Computational mathematics (577 words) [view diff] no match in snippet view article find links to article

areas of mathematics, such as logic (automated theorem proving), discrete mathematics, combinatorics, number theory, and computational algebraic topology

Odd graph (1,924 words) [view diff] no match in snippet view article find links to article

the odd graphs Ok by parameters", Discrete Mathematics, 42 (1): 91–97, doi:10.1016/0012-365X(82)90057-7. Godsil, C. D. (1980), "More odd graph theory"

Angular resolution (graph drawing) (1,665 words) [view diff] no match in snippet view article

Kramer, Horst (2008), "A survey on the distance-colouring of graphs", Discrete Mathematics, 308 (2–3): 422–426, doi:10.1016/j.disc.2006.11.059, MR 2378044

Flip distance (1,411 words) [view diff] no match in snippet view article find links to article

In discrete mathematics and theoretical computer science, the flip distance between two triangulations of the same point set is the number of flips required

Dot product representation of a graph (277 words) [view diff] no match in snippet view article find links to article

Ann; Zito, Jennifer S. (1998), "Dot product representations of graphs", Discrete Mathematics, 181 (1–3): 113–138, doi:10.1016/S0012-365X(97)00049-6, MR 1600755

Vizing's theorem (2,776 words) [view diff] no match in snippet view article find links to article

Favrholdt, Lene M. (2012), Graph Edge Coloring: Vizing's Theorem and Goldberg's Conjecture, Wiley Series in Discrete Mathematics and Optimization, John Wiley

Hadwiger conjecture (graph theory) (2,453 words) [view diff] no match in snippet view article

"Research problem 172", Discrete Mathematics, 121 (1–3): 235–236, doi:10.1016/0012-365X(93)90557-A Catlin, P. A. (1979), "Hajós's graph-colouring conjecture:

Neil J. Calkin (534 words) [view diff] no match in snippet view article find links to article

March 1961) is a professor at Clemson University in the Algebra and Discrete Mathematics group of the School of Mathematical and Statistical Sciences. His

Telephone number (mathematics) (2,039 words) [view diff] no match in snippet view article

also describe the number of matchings (the Hosoya index) of a complete graph on n vertices, the number of permutations on n elements that are involutions

Andries Brouwer (621 words) [view diff] no match in snippet view article find links to article

branches of discrete mathematics, particularly graph theory, finite geometry and coding theory. He has published dozens of papers in graph theory and other

3-3 duoprism (802 words) [view diff] no match in snippet view article find links to article

of strongly regular graphs with parameters λ = 1 {\displaystyle \lambda =1} , μ = 2 {\displaystyle \mu =2} ", Discrete Mathematics and Applications, 14

Andries Brouwer (621 words) [view diff] no match in snippet view article find links to article

branches of discrete mathematics, particularly graph theory, finite geometry and coding theory. He has published dozens of papers in graph theory and other

Trapezoid graph (1,528 words) [view diff] no match in snippet view article find links to article

bitolerance orders and graphs. Discrete Mathematics 181(1–3): 37–51 (1998). Martin Charles Golumbic and Irith B.-A. Hartman, eds., Graph Theory, Combinatorics

Mivar-based approach (3,024 words) [view diff] no match in snippet view article find links to article

incorporates computer science, informatics and discrete mathematics, databases, expert systems, graph theory, matrices and inference systems. The Mivar-based

Ebadollah S. Mahmoodian (250 words) [view diff] no match in snippet view article find links to article

Manouchehr (1997). "Defining sets in vertex colorings of graphs and latin rectangles". Discrete Mathematics. 167–168: 451–60. doi:10.1016/S0012-365X(96)00247-6

Harborth's conjecture (1,088 words) [view diff] no match in snippet view article find links to article

Harborth, Heiko (2001), "Plane integral drawings of planar graphs", Discrete Mathematics, Graph theory (Kazimierz Dolny, 1997), 236 (1–3): 191–195, doi:10

Clique graph (635 words) [view diff] no match in snippet view article find links to article

Bornstein, Claudson F. (1994). "Clique graphs of chordal and path graphs". SIAM Journal on Discrete Mathematics. 7 (2): 331–336. CiteSeerX 10.1.1.52.521

Periodic graph (geometry) (2,096 words) [view diff] no match in snippet view article

of periodic graphs", Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift (PDF), DIMACS Series in Discrete Mathematics and Theoretical

Series–parallel graph (1,031 words) [view diff] no match in snippet view article find links to article

Andreas; Le, Van Bang; Spinrad, Jeremy P. (1999). Graph classes: a survey. SIAM Monographs on Discrete Mathematics. and Applications. Vol. 3. Philadelphia, PA:

Skew-merged permutation (603 words) [view diff] no match in snippet view article find links to article

321-avoiding and skew-merged permutations", Permutation Patterns 2015, Discrete Mathematics & Theoretical Computer Science, 18 (2): P11:1–17, arXiv:1510.06051

Debra Boutin (745 words) [view diff] no match in snippet view article find links to article

and Applied Mathematics; she was elected Secretary of the latter's Discrete Mathematics Activity Group. In 2008 Boutin was the inaugural recipient of the

Rook's graph (3,777 words) [view diff] no match in snippet view article find links to article

of complete bipartite graphs, see de Werra, D.; Hertz, A. (1999), "On perfectness of sums of graphs" (PDF), Discrete Mathematics, 195 (1–3): 93–101, doi:10

Binary tree (5,236 words) [view diff] no match in snippet view article find links to article

the tree Unrooted binary tree Rowan Garnier; John Taylor (2009). Discrete Mathematics:Proofs, Structures and Applications, Third Edition. CRC Press. p

Jennifer Tour Chayes (1,216 words) [view diff] no match in snippet view article find links to article

2012. Chayes is best known for her work on phase transitions in discrete mathematics and computer science, structural and dynamical properties of self-engineered

Planar cover (2,181 words) [view diff] no match in snippet view article find links to article

In graph theory, a planar cover of a finite graph G is a finite covering graph of G that is itself a planar graph. Every graph that can be embedded into

List of things named after Pierre-Simon Laplace (486 words) [view diff] no match in snippet view article find links to article

(potential) Laplace expansion of determinants of matrices Laplace matrices in graph theory Laplace's demon Laplace equation for irrotational flow Laplace force

Noisy-channel coding theorem (2,786 words) [view diff] no match in snippet view article find links to article

Graph showing the proportion of a channel’s capacity (y-axis) that can be used for payload based on how noisy the channel is (probability of bit flips;

Vincent Blondel (715 words) [view diff] no match in snippet view article find links to article

1691 : Discrete mathematics I : Graphs algorithmics and theory LINMA 1702 : Optimisation Models and Methods LINMA 2111 : Discrete mathematics II: Algorithms

Matroid oracle (4,287 words) [view diff] no match in snippet view article find links to article

dependencies between vectors in a vector space or the spanning trees of a graph, among other applications. The most commonly used oracle of this type is

Induced subgraph isomorphism problem (624 words) [view diff] no match in snippet view article find links to article

Uno, Takeaki (1 November 2012). "Subgraph isomorphism in graph classes". Discrete Mathematics. 312 (21): 3164–3173. doi:10.1016/j.disc.2012.07.010. Heggernes

Torrence Parsons (256 words) [view diff] no match in snippet view article find links to article

D. Parsons". Discrete Mathematics. 78 (1–2): 1–5. Parsons, T. D. (1976). "Pursuit–evasion in a graph". Theory and Applications of Graphs. Springer-Verlag

John Adrian Bondy (850 words) [view diff] no match in snippet view article find links to article

Dréville. Bondy, J. A.; Chvátal, V. (1976), "A method in graph theory", Discrete Mathematics, 15 (2): 111–135, doi:10.1016/0012-365X(76)90078-9, MR 0414429

Dijoin (626 words) [view diff] no match in snippet view article find links to article

(PDF), Discrete Mathematics, 32 (2): 213–215, doi:10.1016/0012-365X(80)90057-6, MR 0592858 Lovász, László (1976), "On two minimax theorems in graph", Journal

Borůvka's algorithm (1,176 words) [view diff] no match in snippet view article find links to article

algorithm for finding a minimum spanning tree in a graph, or a minimum spanning forest in the case of a graph that is not connected. It was first published

Pappus configuration (580 words) [view diff] no match in snippet view article find links to article

J.; Mathon, R. A. (eds.), Combinatorial Design Theory, Annals of Discrete Mathematics, vol. 34, Elsevier, pp. 371–378, doi:10.1016/S0304-0208(08)72903-7

Andrásfai graph (250 words) [view diff] no match in snippet view article find links to article

Schacht, On the local density problem for graphs of given odd-girth, Electronic Notes in Discrete Mathematics, Volume 62, 2017, pp. 39-44. Godsil, Chris;

Vertex cover in hypergraphs (1,328 words) [view diff] no match in snippet view article find links to article

Matching Theory, Annals of Discrete Mathematics, vol. 29, North-Holland, ISBN 0-444-87916-1, MR 0859549 Berge, Claude (1973). Graphs and Hypergraphs. Amsterdam:

Icosian game (1,862 words) [view diff] no match in snippet view article find links to article

Writings on Graph Theory: Hamiltonian Circuits and The Icosian Game", in Hopkins, Brian (ed.), Resources for Teaching Discrete Mathematics: Classroom Projects

Dicut (588 words) [view diff] no match in snippet view article find links to article

Giles", Discrete Mathematics, 32 (2): 213–215, doi:10.1016/0012-365X(80)90057-6, MR 0592858 Lovász, László (1976), "On two minimax theorems in graph", Journal

Bruce Reed (mathematician) (499 words) [view diff] no match in snippet view article

Institute of Mathematics, Academia Sinica, retrieved 2023-11-07 "Discrete mathematics", Mathematics & Statistics, University of Victoria, retrieved 2023-11-07

Lexicographic product of graphs (424 words) [view diff] no match in snippet view article find links to article

In graph theory, the lexicographic product or (graph) composition G ∙ H of graphs G and H is a graph such that the vertex set of G ∙ H is the cartesian

Periodic graph (graph theory) (126 words) [view diff] no match in snippet view article

"Periodicity of graph operators", Discrete Mathematics, 235 (1–3): 349–351, doi:10.1016/s0012-365x(00)00288-0[dead link] Prisner, Erich (1995). Graph Dynamics

Tuza's conjecture (809 words) [view diff] no match in snippet view article find links to article

(2021), "On Tuza's conjecture for triangulations and graphs with small treewidth", Discrete Mathematics, 344 (4), Paper No. 112281, arXiv:2002.07925, doi:10

Degeneracy (graph theory) (3,769 words) [view diff] no match in snippet view article

(1991), "Size and connectivity of the k-core of a random graph" (PDF), Discrete Mathematics, 91 (1): 61–68, doi:10.1016/0012-365X(91)90162-U Malliaros

Brouwer–Haemers graph (714 words) [view diff] no match in snippet view article find links to article

the (81,20,1,6) strongly regular graph", A collection of contributions in honour of Jack van Lint, Discrete Mathematics, 106/107: 77–82, doi:10.1016/0012-365X(92)90532-K

Polytree (852 words) [view diff] no match in snippet view article find links to article

Simion, Rodica (1991), "Trees with 1-factors and oriented trees", Discrete Mathematics, 88 (1): 93–104, doi:10.1016/0012-365X(91)90061-6, MR 1099270. Trotter

Daniel P. Sanders (173 words) [view diff] no match in snippet view article find links to article

four, DP Sanders - SIAM Journal on Discrete Mathematics, 1996 - link.aip.org Efficiently four-coloring planar graphs, - gatech.edu [PS], N Robertson, DP

Mark Ellingham (145 words) [view diff] no match in snippet view article find links to article

Fleischner, Herbert (1990), Eulerian Graphs and Related Topics, Part 1, Volume 1, Annals of Discrete Mathematics, vol. 45, North-Holland, pp. 111–112

Squaregraph (646 words) [view diff] no match in snippet view article find links to article

In graph theory, a branch of mathematics, a squaregraph is a type of undirected graph that can be drawn in the plane in such a way that every bounded face

Brooks' theorem (929 words) [view diff] no match in snippet view article find links to article

In graph theory, Brooks' theorem states a relationship between the maximum degree of a graph and its chromatic number. According to the theorem, in a

Matching in hypergraphs (2,606 words) [view diff] no match in snippet view article find links to article

Matching Theory, Annals of Discrete Mathematics, vol. 29, North-Holland, ISBN 0-444-87916-1, MR 0859549 Berge, Claude (1973). Graphs and Hypergraphs. Amsterdam:

Critical graph (853 words) [view diff] no match in snippet view article find links to article

Tuza, Zsolt; Voigt, Margit (6 August 2009), "On list critical graphs", Discrete Mathematics, 309 (15), Elsevier: 4931–4941, doi:10.1016/j.disc.2008.05.021

Ronald Gould (mathematician) (234 words) [view diff] no match in snippet view article

15, 1950) is an American mathematician specializing in combinatorics and graph theory. He is a Goodrich C. White professor emeritus in the Emory University

Penny graph (1,974 words) [view diff] no match in snippet view article find links to article

distance graphs", Discrete Mathematics, 310 (12): 1783–1792, doi:10.1016/j.disc.2009.11.035, MR 2610282 Feuilloley, Laurent (May 29, 2019), "Graphs defined

Separable permutation (1,420 words) [view diff] no match in snippet view article find links to article

the Schröder numbers, and the N-kings problem", SIAM Journal on Discrete Mathematics, 4 (2): 275–280, doi:10.1137/0404025, MR 1093199. Szepieniec, A.

Sparsity matroid (3,459 words) [view diff] no match in snippet view article find links to article

(2014-12-30). "An inductive construction of $(2,1)$-tight graphs". Contributions to Discrete Mathematics. 9 (2). doi:10.11575/cdm.v9i2.62096. ISSN 1715-0868

Rostislav Grigorchuk (1,995 words) [view diff] no match in snippet view article find links to article

"Geometriae Dedicata", "Ukrainian Mathematical Journal", "Algebra and Discrete Mathematics", "Carpathian Mathematical Publications", "Bukovinian Mathematical

Ping Zhang (graph theorist) (590 words) [view diff] no match in snippet view article

2008) Graphs & Digraphs (by Gary Chartrand and Linda Lesniak, with Zhang added as a co-author on the 5th ed., CRC Press, 2010) Discrete Mathematics (with

Wild problem (286 words) [view diff] no match in snippet view article find links to article

(2017), "Representations of nodal algebras of type E", Algebra and Discrete Mathematics, 23 (1): 16–34, hdl:123456789/155928, MR 3634499 Mesbahi, Afshin;

Rotation distance (2,169 words) [view diff] no match in snippet view article find links to article

In discrete mathematics and theoretical computer science, the rotation distance between two binary trees with the same number of nodes is the minimum number

Jit Bose (244 words) [view diff] no match in snippet view article find links to article

David (2006), "On the spanning ratio of Gabriel graphs and β-skeletons", SIAM Journal on Discrete Mathematics, 20 (2): 412–427, doi:10.1137/S0895480197318088

Rainbow matching (2,561 words) [view diff] no match in snippet view article find links to article

Füredi, Zoltán (1989-05-01). "Covering the complete graph by partitions". Discrete Mathematics. 75 (1–3): 217–226. doi:10.1016/0012-365x(89)90088-5.

Upward planar drawing (2,328 words) [view diff] no match in snippet view article find links to article

In graph drawing, an upward planar drawing of a directed acyclic graph is an embedding of the graph into the Euclidean plane, in which the edges are represented

Herbert Wilf (691 words) [view diff] no match in snippet view article find links to article

J. Calkin) "The Number of Independent Sets in a Grid Graph", SIAM Journal on Discrete Mathematics A=B (with Doron Zeilberger and Marko Petkovšek) Algorithms

Mirsky's theorem (1,119 words) [view diff] no match in snippet view article find links to article

Lovász, László (1972), "Normal hypergraphs and the perfect graph conjecture", Discrete Mathematics, 2 (3): 253–267, doi:10.1016/0012-365X(72)90006-4. Mirsky

Jeb Willenbring (921 words) [view diff] no match in snippet view article find links to article

his research falls within the categories of Representation Theory, Discrete Mathematics, and Mathematical Physics. His current research consists of several

Arrangement of lines (6,723 words) [view diff] no match in snippet view article find links to article

800–809 Ageev, A. A. (1996), "A triangle-free circle graph with chromatic number 5", Discrete Mathematics, 152 (1–3): 295–298, doi:10.1016/0012-365X(95)00349-2

Iván Gutman (738 words) [view diff] no match in snippet view article find links to article

mathematical chemistry, graph theory, spectral graph theory and discrete mathematics. Gutman is known for his work in chemical graph theory and topological

Daniela Kühn (597 words) [view diff] no match in snippet view article find links to article

Prize, a biennial best dissertation award given by the Section for Discrete Mathematics of the German Mathematical Society. Together with Deryk Osthus and

Steinitz's theorem (5,977 words) [view diff] no match in snippet view article find links to article

2027, MR 1842113 Grünbaum, Branko (2007), "Graphs of polyhedra; polyhedra as graphs", Discrete Mathematics, 307 (3–5): 445–463, doi:10.1016/j.disc.2005

Wiener–Araya graph (514 words) [view diff] no match in snippet view article find links to article

(1976), "Planar and infinite hypohamiltonian and hypotraceable graphs", Discrete Mathematics, 14 (4): 377–389, doi:10.1016/0012-365x(76)90071-6, MR 0422086

Circle packing theorem (3,857 words) [view diff] no match in snippet view article find links to article

Achilleas (1994), "On the angular resolution of planar graphs", SIAM Journal on Discrete Mathematics, 7 (2): 172–183, doi:10.1137/S0895480193242931, MR 1271989

Pósa's theorem (321 words) [view diff] no match in snippet view article find links to article

in graph theory, is a sufficient condition for the existence of a Hamiltonian cycle based on the degrees of the vertices in an undirected graph. It implies

Triangular prism (1,628 words) [view diff] no match in snippet view article find links to article

Euler's Formula". In Hopkin, Brian (ed.). Resources for Teaching Discrete Mathematics: Classroom Projects, History Modules, and Articles. Mathematical

De Bruijn–Erdős theorem (graph theory) (3,632 words) [view diff] no match in snippet view article

Jensen, Tommy R.; Toft, Bjarne (1995), Graph coloring problems, Wiley-Interscience Series in Discrete Mathematics and Optimization, New York: John Wiley

Minimum degree spanning tree (343 words) [view diff] no match in snippet view article find links to article

degree spanning trees of directed acyclic graphs with applications to the broadcast problem". Discrete Mathematics. 308 (17): 3951–3959. doi:10.1016/j.disc

Intersection number (graph theory) (4,363 words) [view diff] no match in snippet view article

Bill; Stewart, Lorna (2007), "Complexity results on graphs with few cliques", Discrete Mathematics & Theoretical Computer Science, 9 (1): 127–135, doi:10

Advanced level mathematics (1,377 words) [view diff] no match in snippet view article find links to article

sampling. 7. Discrete Mathematics: Deals with separate and distinct mathematical structures, including topics such as combinatorics, graph theory, and

Nash-Williams theorem (567 words) [view diff] no match in snippet view article find links to article

Kaiser, Tomáš (2012). "A short proof of the tree-packing theorem". Discrete Mathematics. 312 (10): 1689–1691. arXiv:0911.2809. doi:10.1016/j.disc.2012.01

Gerard Laman (504 words) [view diff] no match in snippet view article find links to article

Mathematical Institute of the University of Amsterdam, teaching discrete mathematics and mathematics for students in Econometrics. Laman regarded himself

Heiko Harborth (533 words) [view diff] no match in snippet view article find links to article

planar graphs", Discrete Mathematics, 236 (1–3): 191–195, doi:10.1016/S0012-365X(00)00442-8; Mohar, Bojan; Carsten, Thomassen (2001), Graphs on Surfaces

Fáry's theorem (1,261 words) [view diff] no match in snippet view article find links to article

planar graphs", Discrete Mathematics, 236 (1–3): 191–195, doi:10.1016/S0012-365X(00)00442-8. Mohar, Bojan (2003), Problems from the book Graphs on Surfaces

Graph toughness (636 words) [view diff] no match in snippet view article find links to article

MR 1074858. Chvátal, Václav (1973), "Tough graphs and Hamiltonian circuits", Discrete Mathematics, 5 (3): 215–228, doi:10.1016/0012-365X(73)90138-6

Planar separator theorem (10,072 words) [view diff] no match in snippet view article find links to article

Arnold L. (1989), "Universal graphs for bounded-degree trees and planar graphs" (PDF), SIAM Journal on Discrete Mathematics, 2 (2): 145, doi:10.1137/0402014

Clebsch graph (1,136 words) [view diff] no match in snippet view article find links to article

field of graph theory, the Clebsch graph is either of two complementary graphs on 16 vertices, a 5-regular graph with 40 edges and a 10-regular graph with

No-three-in-line problem (3,842 words) [view diff] no match in snippet view article find links to article

nineteen". Proceedings of the Oberwolfach Meeting “Kombinatorik” (1986). Discrete Mathematics. 73 (1–2): 89–90. doi:10.1016/0012-365X(88)90135-5. MR 0974815. Jarník

Latin square (3,884 words) [view diff] no match in snippet view article find links to article

F.; Mullen, Gary L. (1998). Discrete mathematics using Latin squares. Wiley-Interscience Series in Discrete Mathematics and Optimization. New York: John

Arboricity (1,429 words) [view diff] no match in snippet view article find links to article

arboricity of graphs". Discrete Mathematics. 149 (1–3): 93–98. doi:10.1016/0012-365X(94)00313-8. MR 1375101. Jensen, T. R.; Toft, B. (1995). Graph Coloring

Converse relation (1,725 words) [view diff] no match in snippet view article find links to article

ISBN 978-0-521-76268-7. Gunther Schmidt; Thomas Ströhlein (1993). Relations and Graphs: Discrete Mathematics for Computer Scientists. Springer Berlin Heidelberg. pp. 9–10

Frequency partition of a graph (595 words) [view diff] no match in snippet view article find links to article

In graph theory, a discipline within mathematics, the frequency partition of a graph (simple graph) is a partition of its vertices grouped by their degree

List of unsolved problems in computer science (1,199 words) [view diff] no match in snippet view article find links to article

Stefan (2009). "Clique-width is NP-complete" (PDF). SIAM Journal on Discrete Mathematics. 23 (2): 909–939. doi:10.1137/070687256. MR 2519936. S2CID 18055798

Kristina Vušković (310 words) [view diff] no match in snippet view article find links to article

(October 2009), "The Strong Perfect Graph Conjecture: 40 years of attempts, and its resolution", Discrete Mathematics, 309 (20): 6092–6113, doi:10.1016/j

Desargues graph (1,203 words) [view diff] no match in snippet view article find links to article

Alenka (2003), "Partial cubes as subdivision graphs and as generalized Petersen graphs", Discrete Mathematics, 263 (1–3): 157–165, doi:10.1016/S0012-365X(02)00575-7

Halved cube graph (742 words) [view diff] no match in snippet view article find links to article

the hypercube", Discrete Mathematics, 283 (1–3): 29–35, doi:10.1016/j.disc.2003.11.018, MR 2061481. Weisstein, Eric W. "Halved Cube Graph". MathWorld.

Jin-Yi Cai (388 words) [view diff] no match in snippet view article find links to article

with Complex Weights. He was also awarded the Fulkerson Prize in Discrete Mathematics awarded by the American Mathematical Society and the Mathematical

Unit disk graph (1,379 words) [view diff] no match in snippet view article find links to article

Colbourn, Charles J.; Johnson, David S. (1990), "Unit disk graphs", Discrete Mathematics, 86 (1–3): 165–177, doi:10.1016/0012-365X(90)90358-O. Dall,

Induced matching (809 words) [view diff] no match in snippet view article find links to article

Cameron, Kathie (2004), "Induced matchings in intersection graphs", Discrete Mathematics, 278 (1–3): 1–9, doi:10.1016/j.disc.2003.05.001, MR 2035386

David Sumner (201 words) [view diff] no match in snippet view article find links to article

Flandrin, Evelyne; Ryjáček, Zdeněk (1997), "Claw-free graphs — A survey", Discrete Mathematics, 164 (1–3): 87–147, doi:10.1016/S0012-365X(96)00045-3,

Jiří Matoušek (mathematician) (890 words) [view diff] no match in snippet view article

Scholia has a profile for Jiří Matoušek (Q472657). Invitation to Discrete Mathematics (with Jaroslav Nešetřil). Oxford University Press, 1998. ISBN 978-0-19-850207-4

Crown graph (1,137 words) [view diff] no match in snippet view article find links to article

(2004), "Cycle systems in the complete bipartite graph minus a one-factor", Discrete Mathematics, 284 (1–3): 37–43, doi:10.1016/j.disc.2003.11.021,

Daniel Kráľ (556 words) [view diff] no match in snippet view article find links to article

lower bound on the number of perfect matchings in cubic graphs", SIAM Journal on Discrete Mathematics, 23 (3): 1465–1483, CiteSeerX 10.1.1.147.4983, doi:10

Locally linear graph (3,383 words) [view diff] no match in snippet view article find links to article

the (81,20,1,6) strongly regular graph", A collection of contributions in honour of Jack van Lint, Discrete Mathematics, 106/107: 77–82, doi:10.1016/0012-365X(92)90532-K

Lonely runner conjecture (3,289 words) [view diff] no match in snippet view article find links to article

—— (September 2009). "On the chromatic number of circulant graphs". Discrete Mathematics. 309 (18): 5687–5696. doi:10.1016/j.disc.2008.04.041. Betke

András Frank (363 words) [view diff] no match in snippet view article find links to article

Frank, András (1992), "Augmenting graphs to meet edge-connectivity requirements" (PDF), SIAM Journal on Discrete Mathematics, 5 (1): 25–53, doi:10.1137/0405003

Amanda Chetwynd (365 words) [view diff] no match in snippet view article find links to article

education. With Peter Diggle, Chetwynd is the author of the books Discrete Mathematics (Modular Mathematics series, Arnold, 1995) and Statistics and Scientific

Miklós Simonovits (616 words) [view diff] no match in snippet view article find links to article

1979. In the coming years, he was appointed as the professor in Discrete mathematics. He was also a visiting professor at a number of foreign institutions

List of theorems (6,296 words) [view diff] no match in snippet view article find links to article

theory) Brooks's theorem (graph theory) Bruck–Chowla–Ryser theorem (combinatorics) Cameron–Erdős theorem (discrete mathematics) Corners theorem (arithmetic

Road coloring theorem (676 words) [view diff] no match in snippet view article find links to article

about the road coloring conjecture", Proc. EuroComb 2005 (PDF), Discrete Mathematics & Theoretical Computer Science, pp. 279–284. Kari, Jarkko (2003)

Graph polynomial (266 words) [view diff] no match in snippet view article find links to article

Yongtang; Dehmer, Matthias; Li, Xueliang; Gutman, Ivan (2016), Graph Polynomials, Discrete Mathematics and Its Applications, CRC Press, ISBN 9781498755917 This

Grötzsch's theorem (1,189 words) [view diff] no match in snippet view article find links to article

V. A. (2005), "Smaller planar triangle-free graphs that are not 3-list-colorable", Discrete Mathematics, 290 (2–3): 269–274, doi:10.1016/j.disc.2004

Pearls in Graph Theory (626 words) [view diff] no match in snippet view article find links to article

Pearls in Graph Theory: A Comprehensive Introduction is an undergraduate-level textbook on graph theory by Nora Hartsfield and Gerhard Ringel. It was published

Prim's algorithm (2,079 words) [view diff] no match in snippet view article find links to article

algorithm that finds a minimum spanning tree for a weighted undirected graph. This means it finds a subset of the edges that forms a tree that includes

Polygon-circle graph (606 words) [view diff] no match in snippet view article find links to article

Kratochvíl, Jan (1997), "Covering and coloring polygon-circle graphs", Discrete Mathematics, 163 (1–3): 299–305, doi:10.1016/S0012-365X(96)00344-5, MR 1428585

Turán's brick factory problem (1,513 words) [view diff] no match in snippet view article find links to article

bipartite graph be drawn with fewer crossings than the number given by Zarankiewicz? More unsolved problems in mathematics In the mathematics of graph drawing

Laman graph (1,260 words) [view diff] no match in snippet view article find links to article

Streinu, Ileana (2008), "Pebble game algorithms and sparse graphs", Discrete Mathematics, 308 (8): 1425–1437, arXiv:math/0702129, doi:10.1016/j.disc

Strong coloring (581 words) [view diff] no match in snippet view article find links to article

(1990-05-01). "Transversals of Vertex Partitions in Graphs". SIAM Journal on Discrete Mathematics. 3 (2): 206–215. doi:10.1137/0403018. ISSN 0895-4801

Menger's theorem (1,598 words) [view diff] no match in snippet view article find links to article

k-vertex-connected graph k-edge-connected graph Vertex separator Göring, Frank (2000). "Short proof of Menger's theorem". Discrete Mathematics. 219 (1–3): 295–296

Mathematical linguistics (1,489 words) [view diff] no match in snippet view article find links to article

a significant amount of overlap with computational linguistics. Discrete mathematics is used in language modeling, including formal grammars, language

Twin-width (4,129 words) [view diff] no match in snippet view article find links to article

Sylvester, John (June 2023), "Bounds on the twin-width of product graphs", Discrete Mathematics & Theoretical Computer Science, 25 (1), arXiv:2202.11556, doi:10

Social golfer problem (1,043 words) [view diff] no match in snippet view article find links to article

In discrete mathematics, the social golfer problem (SGP) is a combinatorial-design problem derived from a question posted in the usenet newsgroup sci.op-research

W. G. Brown (405 words) [view diff] no match in snippet view article find links to article

Martin; Matoušek, Jiří; Thomas, Robin; Valtr, Pavel (eds.), Topics in Discrete Mathematics: Dedicated to Jarik Nešetřil on the occasion of his 60th birthday

Ermelinda DeLaViña (335 words) [view diff] no match in snippet view article find links to article

Genealogy Project Chartrand, Gary; Zhang, Ping (2008), Chromatic Graph Theory, Discrete Mathematics and Its Applications, CRC Press, p. 100, ISBN 9781584888017

Algorithms and Combinatorics (529 words) [view diff] no match in snippet view article find links to article

Monique Laurent, 1997, vol. 15) Probabilistic Methods for Algorithmic Discrete Mathematics (M. Habib, C. McDiarmid, J. Ramirez-Alfonsin, and B. Reed, 1998,

Order dimension (1,205 words) [view diff] no match in snippet view article find links to article

Walter D. Jr. (1999), "The order dimension of the complete graph", Discrete Mathematics, 201 (1–3): 133–139, doi:10.1016/S0012-365X(98)00315-X, MR 1687882

De Bruijn graph (1,271 words) [view diff] no match in snippet view article find links to article

(1993). "Embedding de Bruijn and shuffle-exchange graphs in five pages". SIAM Journal on Discrete Mathematics. 6 (4): 642–654. doi:10.1137/0406049. MR 1241401

Matroid intersection (1,822 words) [view diff] no match in snippet view article find links to article

"Valuated Matroid Intersection I: Optimality Criteria". SIAM Journal on Discrete Mathematics. 9 (4): 545–561. doi:10.1137/S0895480195279994. ISSN 0895-4801. Murota

Avi Wigderson (1,004 words) [view diff] no match in snippet view article find links to article

graph properties". 2021: Shared the Abel Prize with László Lovász "for their foundational contributions to theoretical computer science and discrete mathematics

Brigitte Servatius (481 words) [view diff] no match in snippet view article find links to article

characterizes the planar Laman graphs, the minimally rigid graphs that can be embedded without crossings in the plane, as the graphs of pseudotriangulations

Nowhere-zero flow (1,600 words) [view diff] no match in snippet view article find links to article

In graph theory, a nowhere-zero flow or NZ flow is a network flow that is nowhere zero. It is intimately connected (by duality) to coloring planar graphs

Games graph (819 words) [view diff] no match in snippet view article find links to article

In graph theory, the Games graph is the largest known locally linear strongly regular graph. Its parameters as a strongly regular graph are (729,112,1

List of permutation topics (282 words) [view diff] no match in snippet view article find links to article

Generalized permutation matrix Inversion (discrete mathematics) Major index Ménage problem Permutation graph Permutation pattern Permutation polynomial

Ortrud Oellermann (467 words) [view diff] no match in snippet view article find links to article

Ortrud R. Oellermann is a South African mathematician specializing in graph theory. She is a professor of mathematics at the University of Winnipeg. Oellermann

Yuri Matiyasevich (1,127 words) [view diff] no match in snippet view article find links to article

Symbolic Logic; and also of the editorial boards for the journals Discrete Mathematics and Applications and Computer Instruments in Education. As a teacher

Arthur Hobbs (mathematician) (846 words) [view diff] no match in snippet view article

combinatorics, discrete mathematics, graph theory, and number theory. Hobbs and his colleague taught a course in the intersection of graph theory and number

Slope number (1,347 words) [view diff] no match in snippet view article find links to article

Achilleas (1994), "On the angular resolution of planar graphs", SIAM Journal on Discrete Mathematics, 7 (2): 172–183, doi:10.1137/S0895480193242931, MR 1271989

Generalized Petersen graph (1,598 words) [view diff] no match in snippet view article find links to article

(2009), "The isomorphism classes of the generalized Petersen graphs", Discrete Mathematics, 309 (1): 231–237, doi:10.1016/j.disc.2007.12.074 Ferrero, Daniela;

Bipartite hypergraph (852 words) [view diff] no match in snippet view article find links to article

possible extension of Hall's theorem to bipartite hypergraphs". Discrete Mathematics. 84 (3): 309–313. doi:10.1016/0012-365X(90)90136-6. ISSN 0012-365X

Sumner's conjecture (1,273 words) [view diff] no match in snippet view article find links to article

1007/BF01206356, MR 1136161. Havet, Frédéric (2002), "Trees in tournaments", Discrete Mathematics, 243 (1–3): 121–134, doi:10.1016/S0012-365X(00)00463-5, MR 1874730

K-outerplanar graph (564 words) [view diff] no match in snippet view article find links to article

k {\displaystyle k} -outerplanar graphs into ℓ 1 {\displaystyle \ell _{1}} ", SIAM Journal on Discrete Mathematics, 20 (1): 119–136, doi:10.1137/S0895480102417379

Rado graph (5,168 words) [view diff] no match in snippet view article find links to article

In the mathematical field of graph theory, the Rado graph, Erdős–Rényi graph, or random graph is a countably infinite graph that can be constructed (with

Conflict-free coloring (554 words) [view diff] no match in snippet view article find links to article

Christian (2018-01-01). "Conflict-Free Coloring of Graphs". SIAM Journal on Discrete Mathematics. 32 (4): 2675–2702. doi:10.1137/17M1146579. hdl:1721

Kelmans–Seymour conjecture (730 words) [view diff] no match in snippet view article find links to article

In graph theory, the Kelmans–Seymour conjecture states that every 5-vertex-connected graph that is not planar contains a subdivision of the 5-vertex complete

Eight queens puzzle (3,793 words) [view diff] no match in snippet view article find links to article

Mynhardt, C. M. (1997), "Domination and irredundance in the queens' graph", Discrete Mathematics, 163 (1–3): 47–66, doi:10.1016/0012-365X(95)00327-S, hdl:1828/2670

Alon–Boppana bound (1,908 words) [view diff] no match in snippet view article find links to article

{d-1}}-o(1).} Nilli, A. (1991), "On the second eigenvalue of a graph", Discrete Mathematics, 91 (2): 207–210, doi:10.1016/0012-365X(91)90112-F, MR 1124768

De Bruijn sequence (3,550 words) [view diff] no match in snippet view article find links to article

"Necklaces of beads in k colors and k-ary de Bruijn sequences". Discrete Mathematics. 23 (3): 207–210. doi:10.1016/0012-365X(78)90002-X. MR 0523071. Martin

Homological connectivity (892 words) [view diff] no match in snippet view article find links to article

bound for the connectivity of the independence complex of a graph". Discrete Mathematics. 311 (21): 2566–2569. doi:10.1016/j.disc.2011.06.010. ISSN 0012-365X

Spanning tree (3,280 words) [view diff] no match in snippet view article find links to article

Donald L. (2004), "5.8 The matrix-tree theorem", Graphs, Algorithms, and Optimization, Discrete Mathematics and Its Applications, CRC Press, pp. 111–116,

Partially ordered set (5,351 words) [view diff] no match in snippet view article find links to article

203: DISCRETE MATHEMATICS. Retrieved 23 July 2021. Kwong, Harris (25 April 2018). "7.4: Partial and Total Ordering". A Spiral Workbook for Discrete Mathematics

Anton Kotzig (866 words) [view diff] no match in snippet view article find links to article

Anton Kotzig on the occasion of his sixtieth birthday (Annals of Discrete Mathematics 12, North-Holland, 1982), with contributions from experts from around

Four color theorem (6,333 words) [view diff] no match in snippet view article find links to article

Kennedy, John W.; Quintas, Louis V. (eds.), Quo Vadis, Graph Theory?, Annals of Discrete Mathematics, vol. 55, Amsterdam: North-Holland, pp. 211–248, doi:10

Smith graph (305 words) [view diff] no match in snippet view article find links to article

; Rašajski, M. (2008). "Decomposition of Smith graphs in maximal reflexive cacti". Discrete Mathematics. 308 (2–3): 355–366. doi:10.1016/j.disc.2006.11

L(2,1)-coloring (249 words) [view diff] no match in snippet view article

(1992). "Labelling graphs with a condition at distance 2". SIAM Journal on Discrete Mathematics. 5 (4): 586–595. doi:10.1137/0405048. MR 1186826. v t e

Thue number (712 words) [view diff] no match in snippet view article find links to article

Michael J. (2008). "Nonrepetitive colorings of graphs of bounded tree-width". Discrete Mathematics. 308 (19): 4473–4478. doi:10.1016/j.disc.2007.08

L(2,1)-coloring (249 words) [view diff] no match in snippet view article

(1992). "Labelling graphs with a condition at distance 2". SIAM Journal on Discrete Mathematics. 5 (4): 586–595. doi:10.1137/0405048. MR 1186826. v t e

Matroid representation (1,784 words) [view diff] no match in snippet view article find links to article

"Infinite antichains of matroids with characteristic set {p}", Discrete Mathematics, 242 (1–3): 175–185, doi:10.1016/S0012-365X(00)00466-0, hdl:10092/13245

Oriented coloring (558 words) [view diff] no match in snippet view article find links to article

0.CO;2-P, MR 1437294. Sopena, Eric (2001), "Oriented graph coloring", Discrete Mathematics, 229 (1–3): 359–369, doi:10.1016/S0012-365X(00)00216-8,

Heawood conjecture (831 words) [view diff] no match in snippet view article find links to article

Heawood graph onto the torus. Grünbaum, Branko; Szilassi, Lajos (2009), "Geometric Realizations of Special Toroidal Complexes", Contributions to Discrete Mathematics

Probabilistic analysis of algorithms (303 words) [view diff] no match in snippet view article find links to article

Jorge; Reed, Bruce (eds.), Probabilistic Methods for Algorithmic Discrete Mathematics, Algorithms and Combinatorics, vol. 16, Springer, pp. 36–92, doi:10

Lovász–Woodall conjecture (1,001 words) [view diff] no match in snippet view article find links to article

In graph theory, the Lovász–Woodall conjecture is a long-standing problem on cycles in graphs. It says: If G is a k-connected graph and L is a set of k

Steiner travelling salesman problem (358 words) [view diff] no match in snippet view article find links to article

multiple steiner TSP with order constraints. Electronic Notes in Discrete Mathematics, 41:487–494, 2013. Huili Zhang, Weitian Tong, Yinfeng Xu, and Guohui

Clique complex (1,643 words) [view diff] no match in snippet view article find links to article

(2002), "Whitney triangulations, local girth and iterated clique graphs", Discrete Mathematics, 258 (1–3): 123–135, doi:10.1016/S0012-365X(02)00266-2. Malnič

Semiorder (2,292 words) [view diff] no match in snippet view article find links to article

Falmagne, Jean-Claude (1997), "Well-graded families of relations", Discrete Mathematics, 173 (1–3): 35–44, doi:10.1016/S0012-365X(96)00095-7, hdl:2013/ULB-DIPOT:oai:dipot

Berlekamp–Van Lint–Seidel graph (454 words) [view diff] no match in snippet view article find links to article

of strongly regular graphs with parameters λ = 1 {\displaystyle \lambda =1} , μ = 2 {\displaystyle \mu =2} ", Discrete Mathematics and Applications, 14

Forcing graph (854 words) [view diff] no match in snippet view article find links to article

(1992). "Inequalities for functionals generated by bipartite graphs". Discrete Mathematics and Applications. 2 (5). doi:10.1515/dma.1992.2.5.489. ISSN 0924-9265

Landon Rabern (804 words) [view diff] no match in snippet view article find links to article

to graph theory, particularly in areas such as the Borodin–Kostochka conjecture, list critical graphs, and Reed's conjecture. His work in discrete mathematics

David Conlon (391 words) [view diff] no match in snippet view article find links to article

having been a fellow of Wadham College, Oxford and Professor of Discrete Mathematics in the Mathematics Institute at the University of Oxford. Conlon

McKay–Miller–Širáň graph (892 words) [view diff] no match in snippet view article find links to article

(2013), "Large vertex-transitive graphs of diameter 2 from incidence graphs of biaffine planes", Discrete Mathematics, 313 (19): 2014–2019, doi:10.1016/j

Bidimensionality (1,390 words) [view diff] no match in snippet view article find links to article

planar graphs, map graphs, bounded-genus graphs and graphs excluding any fixed minor. In particular, bidimensionality theory builds on the graph minor

Sartaj Sahni (1,185 words) [view diff] no match in snippet view article find links to article

sum problem, among his many other research results. Concepts in Discrete Mathematics. Fridley, MN: Camelot Pub. Co. 1985. ISBN 978-0-942-45000-2. Fundamentals

Dual polyhedron (2,276 words) [view diff] no match in snippet view article find links to article

ISBN 978-3-642-62442-1, MR 2038487. Grünbaum, Branko (2007), "Graphs of polyhedra; polyhedra as graphs", Discrete Mathematics, 307 (3–5): 445–463, doi:10.1016/j.disc.2005

Giant component (1,440 words) [view diff] no match in snippet view article find links to article

structurePages displaying short descriptions of redirect targets Graph theory – Area of discrete mathematics Interdependent networks – Subfield of network science

Hanani–Tutte theorem (960 words) [view diff] no match in snippet view article find links to article

In topological graph theory, the Hanani–Tutte theorem is a result on the parity of edge crossings in a graph drawing. It states that every drawing in

Midsphere (2,932 words) [view diff] no match in snippet view article find links to article

Zbl 0387.52006 Sachs, Horst (1994), "Coin graphs, polyhedra, and conformal mapping", Discrete Mathematics, 134 (1–3): 133–138, doi:10.1016/0012-365X(93)E0068-F

Otakar Borůvka (1,021 words) [view diff] no match in snippet view article find links to article

problem: translation of both the 1926 papers, comments, history", Discrete Mathematics, 233 (1–3): 3–36, doi:10.1016/S0012-365X(00)00224-7, hdl:10338.dmlcz/500413

Helmut Alt (536 words) [view diff] no match in snippet view article find links to article

journal paper) was given the SoCG Test of Time Award. Computational Discrete Mathematics: Advanced Lectures (Springer, LNCS 2122, 2001) Efficient Algorithms:

Herschel graph (1,667 words) [view diff] no match in snippet view article find links to article

In graph theory, a branch of mathematics, the Herschel graph is a bipartite undirected graph with 11 vertices and 18 edges. It is a polyhedral graph (the

EXPTIME (1,220 words) [view diff] no match in snippet view article find links to article

Ker-I (2014), Theory of Computational Complexity, Wiley Series in Discrete Mathematics and Optimization (2nd ed.), John Wiley & Sons, Proposition 3.30,

Polyhedral combinatorics (2,304 words) [view diff] no match in snippet view article find links to article

Seymour, Paul D. (1989), Polyhedral Combinatorics, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society,

Zdeněk Dvořák (452 words) [view diff] no match in snippet view article find links to article

new proof of the independence ratio of triangle-free cubic graphs", Discrete Mathematics, 233 (1–3): 233–237, CiteSeerX 10.1.1.138.3764, doi:10

Petersen graph (2,993 words) [view diff] no match in snippet view article find links to article

Silviya (2014), "On the minimum order of k-cop-win graphs", Contributions to Discrete Mathematics, 9 (1): 70–84, arXiv:1308.2841, doi:10.11575/cdm.v9i1

Godfried Toussaint (1,217 words) [view diff] no match in snippet view article find links to article

Music at McGill University. He applied computational geometric and discrete mathematics methods to the analysis of symbolically represented music in general

Folkman graph (1,392 words) [view diff] no match in snippet view article find links to article

007, MR 2290322 Skiena, Steven (1990), Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica, Reading, Massachusetts: Addison-Wesley

GNRS conjecture (893 words) [view diff] no match in snippet view article find links to article

k {\displaystyle k} -outerplanar graphs into ℓ 1 {\displaystyle \ell _{1}} ", SIAM Journal on Discrete Mathematics, 20 (1): 119–136, doi:10.1137/S0895480102417379

Acyclic orientation (1,081 words) [view diff] no match in snippet view article find links to article

MR 2920058. Stanley, Richard P. (1973), "Acyclic orientations of graphs", Discrete Mathematics, 5 (2): 171–178, doi:10.1016/0012-365X(73)90108-8. Welsh, Dominic

Planarization (1,184 words) [view diff] no match in snippet view article find links to article

planarization", in Tamassia, Roberto (ed.), Handbook of Graph Drawing and Visualization, Discrete Mathematics and its Applications (Boca Raton), CRC Press, Boca

Combinatorics and physics (804 words) [view diff] no match in snippet view article find links to article

Gamarnik, Dmitriy Katz, July 9, 2008 "Graph Theory and Statistical Physics", J.W. Essam, Discrete Mathematics, 1, 83-112 (1971). Combinatorics In Statistical

NP-intermediate (1,547 words) [view diff] no match in snippet view article find links to article

Szeider, Stefan (2009). "Clique-width is NP-complete". SIAM Journal on Discrete Mathematics. 23 (2): 909–939. doi:10.1137/070687256. MR 2519936.. Gassner, Elisabeth;

Convex polytope (3,266 words) [view diff] no match in snippet view article find links to article

Lovász, László; Plummer, M. D. (1986), Matching Theory, Annals of Discrete Mathematics, vol. 29, North-Holland, ISBN 0-444-87916-1, MR 0859549 Motzkin,

Johnson graph (1,456 words) [view diff] no match in snippet view article find links to article

Elizabeth (2011), "The automorphism group of a Johnson graph", SIAM Journal on Discrete Mathematics, 25 (1): 267–270, doi:10.1137/090765596 "Johnson", www

Rainbow coloring (1,095 words) [view diff] no match in snippet view article find links to article

Ingo (2013), "The rainbow connection number of 2-connected graphs", Discrete Mathematics, 313 (19): 1884–1892, arXiv:1110.5736, doi:10.1016/j.disc.2012

Polyknight (273 words) [view diff] no match in snippet view article find links to article

ISBN 978-3-642-21203-1. Redelmeier, D. Hugh (1981), "Counting polyominoes: yet another attack", Discrete Mathematics, 36 (2): 191–203, doi:10.1016/0012-365X(81)90237-5

Milan Randić (512 words) [view diff] no match in snippet view article find links to article

during this period increasingly focused on the application of Discrete Mathematics and Graph Theory to the characterization of molecules and biomolecules

229 (number) (569 words) [view diff] no match in snippet view article

Foundation. Gropp, Harald (1997), "Configurations and their realization", Discrete Mathematics, 174 (1–3): 137–151, doi:10.1016/S0012-365X(96)00327-5. Sloane, N

K-minimum spanning tree (1,057 words) [view diff] no match in snippet view article find links to article

Ravi, S. (1996), "Spanning trees short or small", SIAM Journal on Discrete Mathematics, 9 (2): 178–200, arXiv:math/9409222, doi:10.1137/S0895480194266331