Pushing vertices in digraphs without long induced cycles (Q1613399): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3097395 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On rigid circuit graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Tournament games and positive tournaments / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Perfect Elimination and Chordal Bipartite Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2712519 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Pushing the cycles out of multipartite tournaments / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2761044 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An extremal connectivity parameter of tournaments / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hamiltonicity and reversing arcs in digraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4489236 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2715968 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5676236 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3975130 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of satisfiability problems / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0166-218x(01)00299-2 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2015142077 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 09:50, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Pushing vertices in digraphs without long induced cycles |
scientific article |
Statements
Pushing vertices in digraphs without long induced cycles (English)
0 references
29 August 2002
0 references
For a given digraph and a subset \(X\) of its vertex set, pushing \(X\) in the digraph means reversing the orientation of all arcs with exactly one end in \(X\). The problem is to determine whether a digraph can be made acyclic using the push operation. It is shown that the problem remains NP-complete even when restricted to the class of oriented bipartite graph. The paper characterizes the acyclically pushable chordal digraphs in terms of two forbidden subdigraphs, and shows that there is no similar characterization for the family of chordal bipartite digraphs. In addition, a polynomial algorithm for solving the problem for a subclass of the class of chordal bipartite digraphs is given. Finally, the paper gives a characterization of the acyclically pushable bipartite permutation digraphs in terms of a finite number of forbidden subdigraphs.
0 references
chordal digraphs
0 references
characterization
0 references
chordal bipartite digraphs
0 references
permutation digraphs
0 references