Faster access than browser!
29 relations: American Journal of Mathematics, Bipartite graph, Circle graph, Clique (graph theory), Clique problem, Cograph, Comparability graph, Complement graph, Discrete Mathematics (journal), Graph theory, Independent set (graph theory), Intersection graph, Inversion (discrete mathematics), Line segment, Longest increasing subsequence, Mathematics, Modular decomposition, NP-completeness, Order dimension, Parallel (geometry), Partially ordered set, Pathwidth, Perfect graph, Permutation, SIAM Journal on Discrete Mathematics, Time complexity, Trapezoid graph, Treewidth, Vertex (graph theory).
American Journal of Mathematics
The American Journal of Mathematics is a bimonthly mathematics journal published by the Johns Hopkins University Press.
New!!: Permutation graph and American Journal of Mathematics · See more »
Bipartite graph
In the mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets U and V such that every edge connects a vertex in U to one in V. Vertex sets U and V are usually called the parts of the graph.
New!!: Permutation graph and Bipartite graph · See more »
Circle graph
In graph theory, a circle graph is the intersection graph of a set of chords of a circle.
New!!: Permutation graph and Circle graph · See more »
Clique (graph theory)
In the mathematical area of graph theory, a clique is a subset of vertices of an undirected graph such that every two distinct vertices in the clique are adjacent; that is, its induced subgraph is complete.
New!!: Permutation graph and Clique (graph theory) · See more »
Clique problem
In computer science, the clique problem is the computational problem of finding cliques (subsets of vertices, all adjacent to each other, also called complete subgraphs) in a graph.
New!!: Permutation graph and Clique problem · See more »
Cograph
In graph theory, a cograph, or complement-reducible graph, or P4-free graph, is a graph that can be generated from the single-vertex graph K1 by complementation and disjoint union.
New!!: Permutation graph and Cograph · See more »
Comparability graph
In graph theory, a comparability graph is an undirected graph that connects pairs of elements that are comparable to each other in a partial order.
New!!: Permutation graph and Comparability graph · See more »
Complement graph
In graph theory, the complement or inverse of a graph is a graph on the same vertices such that two distinct vertices of are adjacent if and only if they are not adjacent in.
New!!: Permutation graph and Complement graph · See more »
Discrete Mathematics (journal)
Discrete Mathematics is a biweekly peer-reviewed scientific journal in the broad area of discrete mathematics, combinatorics, graph theory, and their applications.
New!!: Permutation graph and Discrete Mathematics (journal) · See more »
Graph theory
In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects.
New!!: Permutation graph and Graph theory · See more »
Independent set (graph theory)
In graph theory, an independent set or stable set is a set of vertices in a graph, no two of which are adjacent.
New!!: Permutation graph and Independent set (graph theory) · See more »
Intersection graph
In the mathematical area of graph theory, an intersection graph is a graph that represents the pattern of intersections of a family of sets.
New!!: Permutation graph and Intersection graph · See more »
Inversion (discrete mathematics)
In computer science and discrete mathematics a sequence has an inversion where two of its elements are out of their natural order.
New!!: Permutation graph and Inversion (discrete mathematics) · See more »
Line segment
In geometry, a line segment is a part of a line that is bounded by two distinct end points, and contains every point on the line between its endpoints.
New!!: Permutation graph and Line segment · See more »
Longest increasing subsequence
In computer science, the longest increasing subsequence problem is to find a subsequence of a given sequence in which the subsequence's elements are in sorted order, lowest to highest, and in which the subsequence is as long as possible.
New!!: Permutation graph and Longest increasing subsequence · See more »
Mathematics
Mathematics (from Greek μάθημα máthēma, "knowledge, study, learning") is the study of such topics as quantity, structure, space, and change.
New!!: Permutation graph and Mathematics · See more »
Modular decomposition
In graph theory, the modular decomposition is a decomposition of a graph into subsets of vertices called modules. A module is a generalization of a connected component of a graph.
New!!: Permutation graph and Modular decomposition · See more »
NP-completeness
In computational complexity theory, an NP-complete decision problem is one belonging to both the NP and the NP-hard complexity classes.
New!!: Permutation graph and NP-completeness · See more »
Order dimension
In mathematics, the dimension of a partially ordered set (poset) is the smallest number of total orders the intersection of which gives rise to the partial order.
New!!: Permutation graph and Order dimension · See more »
Parallel (geometry)
In geometry, parallel lines are lines in a plane which do not meet; that is, two lines in a plane that do not intersect or touch each other at any point are said to be parallel.
New!!: Permutation graph and Parallel (geometry) · See more »
Partially ordered set
In mathematics, especially order theory, a partially ordered set (also poset) formalizes and generalizes the intuitive concept of an ordering, sequencing, or arrangement of the elements of a set.
New!!: Permutation graph and Partially ordered set · See more »
Pathwidth
In graph theory, a path decomposition of a graph G is, informally, a representation of G as a "thickened" path graph, and the pathwidth of G is a number that measures how much the path was thickened to form G.
New!!: Permutation graph and Pathwidth · See more »
Perfect graph
In graph theory, a perfect graph is a graph in which the chromatic number of every induced subgraph equals the size of the largest clique of that subgraph.
New!!: Permutation graph and Perfect graph · See more »
Permutation
In mathematics, the notion of permutation relates to the act of arranging all the members of a set into some sequence or order, or if the set is already ordered, rearranging (reordering) its elements, a process called permuting.
New!!: Permutation graph and Permutation · See more »
SIAM Journal on Discrete Mathematics
SIAM Journal on Discrete Mathematics is a peer-reviewed mathematics journal published quarterly by the Society for Industrial and Applied Mathematics (SIAM).
New!!: Permutation graph and SIAM Journal on Discrete Mathematics · See more »
Time complexity
In computer science, the time complexity is the computational complexity that describes the amount of time it takes to run an algorithm.
New!!: Permutation graph and Time complexity · See more »
Trapezoid graph
In graph theory, trapezoid graphs are intersection graphs of trapezoids between two horizontal lines.
New!!: Permutation graph and Trapezoid graph · See more »
Treewidth
In graph theory, the treewidth of an undirected graph is a number associated with the graph.
New!!: Permutation graph and Treewidth · See more »
Vertex (graph theory)
In mathematics, and more specifically in graph theory, a vertex (plural vertices) or node is the fundamental unit of which graphs are formed: an undirected graph consists of a set of vertices and a set of edges (unordered pairs of vertices), while a directed graph consists of a set of vertices and a set of arcs (ordered pairs of vertices).
New!!: Permutation graph and Vertex (graph theory) · See more »
References
[1] https://en.wikipedia.org/wiki/Permutation_graph
