Graphclass: chordal bipartite

The following definitions are equivalent:
  1. A bipartite graph is chordal bipartite if each cycle of length at least 6 has a chord.
  2. Let $G=(X,Y,E)$ be a bipartite graph. An edge $(x,y)$ is called bisimplicial if $N(x)\cup N(y)$ induces a complete bipartite graph in $G$.
    Let $(e_1,\dots,e_m)$ be an ordering of the edges of $G$. Let $G_0=G$ and $G_i = G_{i-1} \setminus e_i$ ($G_i$ is obtained from $G_{i-1}$ by removing the edge $e_i$ but not its endvertices). The ordering $(e_1,\dots,e_m)$ is a perfect edge-without-vertex elimination ordering if $e_i$ is bisimplicial in $G_{i-1}$ for all $1\le i\le m$.
    A bipartite graph is chordal bipartite if it admits a perfect edge-without-vertex elimination ordering.
  3. Let $G=(X,Y,E)$ be a bipartite graph. Let $G'$ be the graph obtained from $G$ by adding an edge between every pair of vertices in $X$. A bipartite graph $G$ is chordal bipartite if $G'$ is strongly chordal .

Note these are not chordal because induced C4 s are allowed. The name bipartite ∩ weakly chordal is clearer.

References

[457]

Equivalent classes

[+]Details

Complement classes

Related classes

Inclusions

The map shows the inclusions between the current class and a fixed set of landmark classes. Minimal/maximal is with respect to the contents of ISGCI. Only references for direct inclusions are given. Where no reference is given, check equivalent classes or use the Java application. To check relations other than inclusion (e.g. disjointness) use the Java application, as well.

Map

[+]Details

Minimal superclasses

[+]Details

Maximal subclasses

[+]Details

Problems

3-Colourability
[?]
Input: A graph G in this class.
Output: True iff each vertex of G can be assigned one colour out of 3 such that whenever two vertices are adjacent, they have different colours.
Linear [+]Details
Clique
[?]
Input: A graph G in this class and an integer k.
Output: True iff G contains a set S of pairwise adjacent vertices, with |S| >= k.
Linear [+]Details
Clique cover
[?]
Input: A graph G in this class and an integer k.
Output: True iff the vertices of G can be partitioned into k sets Si, such that whenever two vertices are in the same set Si, they are adjacent.
Polynomial [+]Details
Cliquewidth
[?]
Whether the cliquewidth of the graphs in this class is bounded by a constant k .
The cliquewidth of a graph is the number of different labels that is needed to construct the graph using the following operations:
  • creation of a vertex with label i,
  • disjoint union,
  • renaming labels i to label j,
  • connecting all vertices with label i to all vertices with label j.
Unbounded [+]Details
Cliquewidth expression
[?]
Input: A graph G in this class.
Output: An expression that constructs G according to the rules for cliquewidth, using only a constant number of labels.
Undefined if this class has unbounded cliquewidth.
Unbounded or NP-complete [+]Details
Colourability
[?]
Input: A graph G in this class and an integer k.
Output: True iff each vertex of G can be assigned one colour out of k such that whenever two vertices are adjacent, they have different colours.
Linear [+]Details
Cutwidth
[?]
Input: A graph G in this class and an integer k.
Output: True iff the cutwidth of G is at most k (see bounded cutwidth).
Unknown to ISGCI [+]Details
Domination
[?]
Input: A graph G in this class and an integer k.
Output: True iff G contains a set S of vertices, with |S| <= k, such that every vertex in G is either in S or adjacent to a vertex in S.
NP-complete [+]Details
Feedback vertex set
[?]
Input: A graph G in this class and an integer k.
Output: True iff G contains a set S of vertices, with |S| <= k, such that every cycle in G contains a vertex from S.
Polynomial [+]Details
Hamiltonian cycle
[?]
Input: A graph G in this class.
Output: True iff G has a simple cycle that goes through every vertex of the graph.
NP-complete [+]Details
Hamiltonian path
[?]
Input: A graph G in this class.
Output: True iff G has a simple path that goes through every vertex of the graph.
NP-complete [+]Details
Independent set
[?]
Input: A graph G in this class and an integer k.
Output: True iff G contains a set S of pairwise non-adjacent vertices, such that |S| >= k.
Polynomial [+]Details
Recognition
[?]
Input: A graph G.
Output: True iff G is in this graph class.
Polynomial [+]Details
Treewidth
[?]
Input: A graph G in this class and an integer k.
Output: True iff the treewidth of G is at most k (see bounded treewidth).
Polynomial [+]Details
Weighted clique
[?]
Input: A graph G in this class with weight function on the vertices and a real k.
Output: True iff G contains a set S of pairwise adjacent vertices, such that the sum of the weights of the vertices in S is at least k.
Linear [+]Details
Weighted feedback vertex set
[?]
Input: A graph G in this class with weight function on the vertices and a real k.
Output: True iff G contains a set S of vertices, such that the sum of the weights of the vertices in S is at most k and every cycle in G contains a vertex from S.
Unknown to ISGCI [+]Details
Weighted independent set
[?]
Input: A graph G in this class with weight function on the vertices and a real k.
Output: True iff G contains a set S of pairwise non-adjacent vertices, such that the sum of the weights of the vertices in S is at least k.
Polynomial [+]Details