The Even Cycle Problem for Directed Graphs
From MaRDI portal
Recommendations
Cites work
- Characterization of even directed graphs
- Cycles of length 0 modulo k in directed graphs
- Even cycles in directed graphs
- Every 7-regular digraph contains an even cycle
- scientific article; zbMATH DE number 4077268 (Why is no real title available?)
- scientific article; zbMATH DE number 3326387 (Why is no real title available?)
- Matching structure and the matching lattice
- ON THE TWO-COLOURING OF HYPERGRAPHS
- Perfect matchings in hexagonal systems
- Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs
- Regular subgraphs of dense graphs
- Sign-nonsingular matrices and even cycles in directed graphs
- Signsolvability revisited
- The Even Cycle Problem for Planar Digraphs
Cited in
(48)- Even cycles in directed graphs
- Cycles of length 0 modulo k in directed graphs
- Every 7-regular digraph contains an even cycle
- Square critically 3-chromatic hypergraphs
- Regularity of matrices in min-algebra and its time-complexity
- Hypergraph colouring and the Lovász local lemma
- Blocking set free configurations and their relations to digraphs and hypergraphs
- On the digraphs of sign solvable linear systems
- Note on alternating directed cycles
- Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs
- Out-degree reducing partitions of digraphs
- Forbidding induced even cycles in a graph: typical structure and counting
- Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications
- On digraphs and forbidden configurations of strong sign nonsingular matrices
- The S^2NS digraphs and the cycle linear system of a digraph
- On 2-coloring certain k-uniform hypergraphs
- Singular values, doubly stochastic matrices, and applications
- On proper colorings of hypergraphs
- Partitioning the vertices of a cubic graph into two total dominating sets
- Pseudo 2-factor isomorphic regular bipartite graphs
- 2-colorings in \(k\)-regular \(k\)-uniform hypergraphs
- Corrigendum to ``Graphs and digraphs with all 2-factors isomorphic [J. Combin. Theory Ser. B 92 (2) (2004) 395-404]
- On maximal sign-nonsingular matrices
- Partitioning claw-free subcubic graphs into two dominating sets
- On 2-colorings of hypergraphs
- General models for variations of the even cycle problem
- Greedy colorings of uniform hypergraphs
- The Even Cycle Problem for Planar Digraphs
- Fractional domatic, idomatic, and total domatic numbers of a graph
- An extension to ‘an algorithm for rinding a circuit of even length in a directed graph’
- Algorithmic complexity of proper labeling problems
- Even Directed Cycles inH-Free Digraphs
- Even Cycles in Directed Graphs
- Tropical patterns of matrices and the Gondran-Minoux rank function
- Pseudo and strongly pseudo 2-factor isomorphic regular graphs and digraphs
- (p,q)-odd digraphs
- The 1-2-3-conjecture for hypergraphs
- Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree
- Color-blind index in graphs of very low degree
- scientific article; zbMATH DE number 2192144 (Why is no real title available?)
- On the dynamic coloring of graphs
- Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set
- The structure of (even) directed cycles
- On existence theorems
- Oriented cycles in digraphs of large outdegree
- What is on his mind?
- Dynamic chromatic number of regular graphs
- Coloring and the Lovász local lemma
This page was built for publication: The Even Cycle Problem for Directed Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3993798)
