Search results

...he special case of the [[strong perfect graph conjecture]] for [[claw-free graph]]s.<ref>{{citation | title = The strong perfect-graph conjecture is true for <math>K_{1,3}</math>-free graphs ...

...l 1941) is a British mathematician specializing in [[combinatorics]] and [[graph theory]]. His current positions are as [[emeritus]] professor of Combinator ...with <math>2n</math> vertices, if <math> k \geq 12n/7</math> then it is [[Graph factorization|1-factorizable]].<ref name="fact">[[Amanda Chetwynd|Chetwynd, ...

...}} She completed a Ph.D. at Padua in 1996 with the dissertation ''Il Prime Graph dei gruppi finiti'' [''the prime graphs of finite groups''], supervised by ...research on [[prime graph]]s of [[finite group]]s. These are [[undirected graph]]s that have a vertex for each [[prime factor]] of the [[order of a group]] ...

...tistics at [[East Tennessee State University]] known for her research in [[graph theory]] and particularly on [[dominating set]]s. Haynes is the author of two books on [[dominating set]]s in [[graph theory]]: ...

...ge Logic of Random Graphs''''' is a book on [[zero-one law]]s for [[random graph]]s. It was written by [[Joel Spencer]] and published in 2001 by [[Springer- the probability of generating a graph with the property tends to zero or one in the limit as <math>n</math> goes ...

...born Canadian mathematician known for her work on [[dominating set]]s in [[graph theory]], including domination versions of the [[eight queens puzzle]].{{r| ...nar graph]]s by repeatedly adding vertices with prescribed [[neighborhood (graph theory)|neighborhoods]].{{r|diss}} ...

{{Short description|Graph used in computational complexity theory and graph theory}} [[File:Compound of two tetrahedra.png|thumb|The Frankl–Rödl graph <math>\operatorname{FR}_{1/3}^{3}</math>, formed by connecting vertices at ...

...ersen graph, unit distance.svg|thumb|170px|The dimension of the [[Petersen graph]] is 2.]] ...eger {{mvar|n}} such that there exists a "classical representation" of the graph in the [[Euclidean space]] of dimension {{mvar|n}} with all the edges havin ...

...s |language=en}}</ref> was an American [[mathematician]] specializing in [[graph theory]]. He spent his teaching career at [[Texas A&M University]]. ...ing in squares and higher powers of graphs, and his thesis adviser was the graph theorist [[William Thomas Tutte]]. ...

...discrete geometry]], [[geometric probability]], and the theory of [[random graph]]s.{{r|fmi}} ...a [[Hamiltonian circuit]], and on the probability that a random [[directed graph]] is [[Strongly connected component|strongly connected]].{{r|rg}}{{ran|B}}{ ...

...ordis.europa.eu/project/rcn/210050/factsheet/en|title=Growth in Groups and Graph Isomorphism Now}}</ref> ...ces and its complement can be covered with ''n''²/4+2 [[Clique (graph theory)|cliques]].<ref>{{Cite journal|last=Pyber|first=László|title=Clique ...

...ian]] [[mathematician]], expert in [[statistics]], [[combinatorics]] and [[graph theory]]. ...on regularly path connected graphs; [[Kotzig's theorem]] on the [[Degree (graph theory)|degrees of vertices]] in [[convex polyhedron|convex polyhedra]]; as ...

'''William G. Brown''' is a Canadian mathematician specializing in [[graph theory]]. He is a [[professor emeritus]] of mathematics at [[McGill Univers ...and [[W. T. Tutte]]. His dissertation was ''Enumeration Problems Of Linear Graph Theory (Problems in the Enumeration of Maps)''.{{r|mg|kal}} ...

...stance from the identity will a particule walking randomly on the [[Cayley graph]] of a group be after <math>n</math> steps, giving new examples with unexpe [[Category:Group theorists]] ...

| known_for = [[Graph theory]]<br/>[[Number theory]] ...er on the series of chromatic numbers and Brooks' theorem, titled '' Hajós graph coloring conjecture: variations and counterexamples''.<ref name=catlin>{{ci ...

...ize [[Leavitt algebra]]s and may be considered as algebraic analogues of [[graph C*-algebras]]. of a graph. ''J. Algebra'' 293 (2005), no. 2, 319–334.</ref> as well as by Pere Ara, M ...

...2018|access-date=2021-09-23}}</ref> Bodlaender is known for his work on [[graph algorithm]]s and [[parameterized complexity]] and in particular for algorit [[Category:Graph theorists]] ...

...of the [[Canadian Mathematical Society]]. Her research interests include [[graph theory]] and the theory of [[combinatorial design]]s. Originally from Austr ...culty at Simon Fraser University in 1981,{{r|pouliot}} and married another graph theorist there, [[Brian Alspach]].{{r|lh}} She became a full professor in 1 ...

[[File:Fleischner's theorem.svg|thumb|360px|A 2-vertex-connected graph, its square, and a Hamiltonian cycle in the square]] ...[[k-vertex-connected graph|2-vertex-connected graph]], then the [[Power of graph|square]] of <math>G</math> is Hamiltonian. It is named after [[Herbert Flei ...

...n]] (1948–1995) also achieved fame as a mathematician, doing research on [[graph theory]]. [[Category:Partial differential equation theorists]] ...