Yuxuan Yang

activity

20212026

most citedMeta-Auxiliary Learning for Micro-Expression Recognition

5 citations · 12 across the 31 of their papers we have counts for

collaborators

Showing math.COShow all

6 papers · 1 filter

math.CO2026

Inversion Diameter of Planar Graphs

Yichen Wang, Yuxuan Yang

Given an oriented graph $G$ and a subset of vertices $X \subseteq V (G)$ , the \emph{inversion} of $X$ is the operation that reverses the orientation of every arc with bo…

math.CO2025

The minimum edge-pancyclic graph of a given order

Xiamiao Zhao, Yuxuan Yang

A graph $G$ of order $n$ is called edge-pancyclic if, for every integer $k$ with $3 \leq k \leq n$ , every edge of $G$ lies in a cycle of length $k$ . Determining the minimum size $f…

math.CO2024

Inversion diameter and treewidth

Yichen Wang, Haozhe Wang, Yuxuan Yang +1

In an oriented graph $G$ , the inversion of a subset $X$ of vertices is the operation that reverses the orientation of all arcs with both end-vertices in $X$ . The i…

math.CO2024★ 1 cited

The inversion number of dijoins and blow-up digraphs

Haozhe Wang, Yuxuan Yang, Mei Lu

For an oriented graph $D$ , the $in v er s i o n$ of $X \subseteq V (D)$ in $D$ is the digraph obtained from $D$ by reversing the direction of all arcs with both ends in $X$ . The inversion…

math.CO2023

Weak degeneracy of regular graphs

Yuxuan Yang

Motivated by the study of greedy algorithms for graph coloring, Bernshteyn and Lee introduced a generalization of graph degeneracy, which is called weak degeneracy. In this paper,…

math.CO2022

Optimal Locating-Paired-Dominating Sets in King Grids

Yuxuan Yang

In this paper, we continue the study of locating-paired-dominating set, abbreviated LPDS, in graphs introduced by McCoy and Henning. Given a finite or infinite graph $G = (V, E)$ , a s…