Six-flows of signed graphs with frustration index three.

Signed Circuit $6$-Covers of Signed $K_4$-Minor-Free Graphs.

Signed planar graphs with Δ ≥ 8 are Δ-edge-colorable.

Flows on flow-admissible signed graphs.

Edge DP-coloring in planar graphs.

Flow number of signed Halin graphs.

Flows on Signed Graphs without Long Barbells.

Neighbor Sum Distinguishing Total Choosability of Cubic Graphs.

Edge coloring of signed graphs.

Six-flows on almost balanced signed graphs.

Shortest circuit covers of signed graphs.

Signed Graphs: From Modulo Flows to Integer-Valued Flows.

Neighbor sum distinguishing list total coloring of subcubic graphs.

Neighbor sum distinguishing total coloring of graphs with bounded treewidth.

Multiple weak 2-linkage and its applications on integer flows of signed graphs.

List neighbor sum distinguishing edge coloring of subcubic graphs.

Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring.

Adjacent vertex distinguishing total coloring of graphs with maximum degree 4.

On the p-reinforcement and the complexity.

The p-domination number of complete multipartite graphs.

Trees with maximum p-reinforcement number.

Covering digraphs with small indegrees or outdegrees by directed cuts.

The total bondage number of grid graphs.

Panconnectivity of Cartesian product graphs.

The <i>p</i>-Bondage Number of Trees.

On the (2, 2)-domination number of trees.

A characterization of <i>(γ_t, γ₂)</i>-trees.

Bipanconnectivity of Cartesian product networks.

Bounded edge-connectivity and edge-persistence of Cartesian product of graphs.