Search results

{{Short description|Graph coloring where graph elements are assigned sets of colors}} ...onal coloring.svg|right|thumb| 5:2-coloring of [[Dodecahedron|Dodecahedral graph]]. A 4:2-coloring of ...

* [[Planar separator theorem]], a theorem in graph theory ** [[Vertex separator]], a notion in graph theory ...

This is a '''list of [[graph theory]] topics''', by Wikipedia page. See [[glossary of graph theory]] for basic terminology. ...

{{short description|Graph coloring of both the edges and vertices}} ...of [[Foster cage]] with 6 colors. The '''total chromatic number''' of this graph is 6 since the degree of each vertex is 5 (5 adjacent edges + 1 vertex =&nb ...

...ory)|diameter]] 3, [[girth (graph theory)|girth]] 3, [[connectivity (graph theory)|vertex connectivity]] 1, and [[degree sequence]] {{math|<3, 3, 3, 2, 2, 1> ...ticular [[graph labeling|labellings]] or [[graph drawing|drawings]] of the graph.<ref name="l">{{citation ...

{{Short description|Graph in graph theory}} [[Image:Graph-lexicographic-product.svg|thumb|upright=1.2|The lexicographic product of gr ...

{{Short description|Number of forests a graph's edges may be partitioned into}} ...Williams theorem]] provides necessary and sufficient conditions for when a graph is ''k''-arboric. ...

[[File:Koenigs-theorem-graph.svg|thumb|An example of a bipartite graph, with a maximum matching (blue) and minimum vertex cover (red) both of size ...also in 1931, by [[Jenő Egerváry]] in the more general case of [[weighted graph]]s. ...

...he Erdős–Faber–Lovász conjecture: a graph formed from four [[clique (graph theory)|clique]]s of four vertices each, any two of which intersect in a single ve ...st one shared vertex, then the union of the [[graph (discrete mathematics)|graph]]s can be properly colored with {{mvar|k}}&nbsp;colors.}} ...

{{Short description|Result in combinatorics and graph theory}} ...is that any subset of vertices from one group has a [[neighbourhood (graph theory)|neighbourhood]] of equal or greater size. ...

{{short description|Graph whose vertices correspond to combinations of a set of n elements}} {{For|the '''Kneser neighborhood graph''' of unimodular lattices|Niemeier lattice}} ...

In [[graph theory]], an '''isomorphism of [[Graph (discrete mathematics)|graphs]]''' ''G'' and ''H'' is a [[bijection]] betwe such that any two vertices ''u'' and ''v'' of ''G'' are [[Adjacent (graph theory)|adjacent]] in ''G'' [[if and only if]] <math>f(u)</math> and <math>f(v)</m ...

[[Image:Devils-staircase.svg|thumb|right|450px|The graph of the winding number of the [[circle map]] is an example of a singular fun ...namical system]]s. Most famously, perhaps, they lie at the center of the [[fractional quantum Hall effect]]. ...

{{Short description|Intersection graph of unit disks in the plane}} ...aph.svg|thumb|A collection of unit circles and the corresponding unit disk graph.]] ...

{{Short description|Cubic graph with 10 vertices and 15 edges}} {{Infobox graph ...

{{Short description|Probability theory concept}} In [[probability theory]], '''fractional Brownian motion''' ('''fBm'''), also called a '''fractal Brownian motion''' ...

In [[chaos theory]], the '''correlation dimension''' (denoted by ''ν'') is a measure of the [ ...real utility of the correlation dimension is in determining the (possibly fractional) dimensions of fractal objects. There are other methods of measuring dimens ...

{{about|the concept in signal theory and processing measured in hertz|use in computing and networking expressed [[Image:Baseband.svg|right|300px|thumb|Amplitude (a) vs. frequency (f) graph illustrating [[baseband]] bandwidth. Here the bandwidth equals the upper fr ...

...by inserting zero-valued samples between the original ones. And the third graph is the DTFT of the filter output. The bottom table expresses the maximum fi ...nd <math>L=3,</math> resulting in the desired spectral distribution (third graph). The filter's bandwidth is the [[Nyquist frequency]] of the original <mat ...

...orem]]. In physics, it has numerous applications, typically resulting in a fractional [[charge (physics)|charge]] due to the asymmetry of the spectrum of a [[Dir ...<math> 0<\alpha<1 </math> we have <math> B(\alpha)=1/2-\alpha </math>. The graph of <math> B(\alpha) </math> is therefore a periodic sawtooth curve. ...