Loop conditions for strongly connected digraphs

DOI10.1142/S0218196720500083MaRDI QIDQ4960455zbMATH OpenOpenAlexWikidataFDO

Authors Miroslav Olšák

Publication date 16 April 2020

Published in International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218196720500083

zbMATH Keywords

loop conditionsMaltsev conditionsSiggers term

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Applications of universal algebra in computer science (08A70) Equational logic, Mal'tsev conditions (08B05) Free algebras (08B20)

Recommendations

• scientific article; zbMATH DE number 4150206
• Strong connectedness of generalized circulant digraphs
• Connectivity of circulant digraphs
• Strong Chordality of Graphs with Possible Loops
• Connectedness of digraphs and graphs under constraints on the conditional diameter
• On strongly connected digraphs with bounded cycle length
• scientific article; zbMATH DE number 1135766
• Strong subgraph connectivity of digraphs
• Strong regularity and circulant graphs
• scientific article; zbMATH DE number 1382546

Cites work

• H-coloring dichotomy revisited
• A strong Mal'cev condition for locally finite varieties omitting the unary type
• Absorbing subalgebras, cyclic terms, and the constraint satisfaction problem
• Absorption in universal algebra and CSP
• Algebraic logic and universal algebra in computer science. Conference, Ames, Iowa, USA, June 1-4, 1988. Proceedings
• Classifying the Complexity of Constraints Using Finite Algebras
• Constraint Satisfaction Problems with Infinite Templates
• scientific article; zbMATH DE number 1064591 (Why is no real title available?)
• scientific article; zbMATH DE number 7359806 (Why is no real title available?)
• scientific article; zbMATH DE number 3091018 (Why is no real title available?)
• Loop conditions
• On the complexity of H-coloring
• Optimal strong Mal'cev conditions for omitting type 1 in locally finite varieties.
• Some very weak identities
• Taylor term does not imply any nontrivial linear one-equality Maltsev condition
• The algebraic dichotomy conjecture for infinite domain constraint satisfaction problems
• The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
• The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)
• The shape of congruence lattices
• The structure of finite algebras
• The weakest nontrivial idempotent equations
• Universal algebra. Fundamentals and selected topics

Cited in

(6)

• Necessary and sufficient conditions for circulant digraphs to be antistrong, weakly-antistrong and anti-Eulerian
• The structure of polynomial operations associated with smooth digraphs.
• Smooth digraphs modulo primitive positive constructability and cyclic loop conditions
• Local–global property for G-invariant terms
• Deciding the existence of quasiweak near unanimity terms in finite algebras
• Topology and Adjunction in Promise Constraint Satisfaction

This page was built for publication: Loop conditions for strongly connected digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4960455)