Cograph and Separable permutation

Shortcuts: Differences, Similarities, Jaccard Similarity Coefficient, References.

Difference between Cograph and Separable permutation

Cograph vs. Separable permutation

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. In combinatorial mathematics, a separable permutation is a permutation that can be obtained from the trivial permutation 1 by direct sums and skew sums.

Forbidden graph characterization

In graph theory, a branch of mathematics, many important families of graphs can be described by a finite set of individual graphs that do not belong to the family and further exclude all graphs from the family which contain any of these forbidden graphs as (induced) subgraph or minor.

Cograph and Forbidden graph characterization · Forbidden graph characterization and Separable permutation · See more »

Induced path

In the mathematical area of graph theory, an induced path in an undirected graph G is a path that is an induced subgraph of G. That is, it is a sequence of vertices in G such that each two adjacent vertices in the sequence are connected by an edge in G, and each two nonadjacent vertices in the sequence are not connected by any edge in G. An induced path is sometimes called a snake, and the problem of finding long induced paths in hypercube graphs is known as the snake-in-the-box problem.

Cograph and Induced path · Induced path and Separable permutation · See more »

Information Processing Letters

Information Processing Letters is a peer reviewed scientific journal in the field of computer science, published by Elsevier.

Cograph and Information Processing Letters · Information Processing Letters and Separable permutation · See more »

Lowest common ancestor

In graph theory and computer science, the lowest common ancestor (LCA) of two nodes and in a tree or directed acyclic graph (DAG) is the lowest (i.e. deepest) node that has both and as descendants, where we define each node to be a descendant of itself (so if has a direct connection from, is the lowest common ancestor).

Cograph and Lowest common ancestor · Lowest common ancestor and Separable permutation · 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.

Cograph and NP-completeness · NP-completeness and Separable permutation · 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.

Cograph and Partially ordered set · Partially ordered set and Separable permutation · See more »

Permutation graph

In mathematics, a permutation graph is a graph whose vertices represent the elements of a permutation, and whose edges represent pairs of elements that are reversed by the permutation.

Cograph and Permutation graph · Permutation graph and Separable permutation · See more »

Series-parallel partial order

In order-theoretic mathematics, a series-parallel partial order is a partially ordered set built up from smaller series-parallel partial orders by two simple composition operations.

Cograph and Series-parallel partial order · Separable permutation and Series-parallel partial order · 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).

Cograph and SIAM Journal on Discrete Mathematics · SIAM Journal on Discrete Mathematics and Separable permutation · See more »