|
|
|
|
Perfect graph
Perfect graph In graph theory, a perfect graph is a graph in which the ...
http://en.wikipedia.org/wiki/Perfect_graph - 8k - Cached - Similar pages
|
Perfect graph (translated from German)
Perfect graph In that Graphentheorie is called Graph perfectly, if for everyone induced Subgraphen it ... number agrees. An induced Subgraph of a graph consists thereby of a subset that Knot and all inzidenten Edges. In a perfect graph know chromatic number, clique number ...
http://de.wikipedia.org/wiki/Perfekter_Graph - 3k - Cached (German) - Wikipedia (German) - Similar pages
|
Weak perfect graph set (translated from German)
Weak perfect graph set That weak perfect graph set meant, that G exactly then perfectly is, if G C is perfect. It became already 1972 of Lovász ...
http://de.wikipedia.org/wiki/Schwacher_Perfekte-Graphen-Satz - 1k - Cached (German) - Wikipedia (German) - Similar pages
|
Graph theory
Graph theory A graph diagram of a graph with 6 vertices and 7 edges. In mathematics and computer science, graph theory studies the properties of graphs. Informally, a graph is a set of objects called ...
http://en.wikipedia.org/wiki/Graph_theory - 21k - Cached - Similar pages
|
Graph (mathematics)
Graph (mathematics) This article just presents the basic definitions. For a broader view see graph theory. For another mathematical use of "graph", see graph of a function. An undirected graph with 6 vertices (nodes) and 7 ...
http://en.wikipedia.org/wiki/Graph_(mathematics) - 18k - Cached - Similar pages
|
Chordal graph
Chordal graph A cycle (black) with two chords (green). As for this part, the graph is chordal. However, removing one green edge would result in a non-chordal graph. Indeed, the other green edge with three ... of lenght four with no chords. In graph theory, a graph is chordal if each of its ...
http://en.wikipedia.org/wiki/Chordal_graph - 3k - Cached - Similar pages
|
Graph coloring
Graph coloring A 3-coloring suits this graph, but fewer colors would result in adjacent ... minimum number of colors for an arbitrary graph is NP-hard. In graph theory, graph coloring is an assignment of "colors", ( ...
http://en.wikipedia.org/wiki/Graph_coloring - 14k - Cached - Similar pages
|
Interval graph
Interval graph In graph theory, an interval graph is a graph that captures the intersections among a set ... set of intervals. Then the corresponding interval graph is G = (V, E) where |
Bipartite graph
Bipartite graph In the mathematical field of graph theory, a bipartite graph is a special graph where the set of vertices can be ... sharing an edge. Definitions A simple undirected graph is ...
http://en.wikipedia.org/wiki/Bipartite_graph - 4k - Cached - Similar pages
|
Petersen graph
Petersen graph The Petersen graph is most commonly drawn as a pentagon ... star inside, with five spokes. The Petersen graph has crossing number 2. The Petersen graph is a unit-distance graph: it can be drawn in the ...
http://en.wikipedia.org/wiki/Petersen_graph - 11k - Cached - Similar pages
|
| Page:1 2 3 4 5 6 7 8 9 10 Next >> |
