Cubic graphs – those regular graphs in which every vertex has degree three – remain a fertile area of research in both combinatorics and theoretical computer science. These graphs are not only ...

Dynamic uncertain causality graph (DUCG) provides a dynamic inference method without causality propagation across time slices, the disadvantage of which lies in the interpretability and applicability.

Conjecture (Berge and Fulkerson): Every 2-connected cubic graph has a collection of six perfect matchings that together cover every edge exactly twice. This conjecture is attributed to Berge in [2].

A collection of tutorials for using Cypher and Neo4j for creating, querying, analyzing, and doing process mining with event knowledge graphs. All tutorials require a clean instance of the Neo4j graph ...

The combination of cubic fuzzy graphs and fuzzy graph structures, the cubic fuzzy graph structure specializes for handling complicated issues, particularly those involving many interactions. This type ...