Fuliang Lu

activity

20122023

collaborators

6 papers

math-ph2023

Counting spanning trees of (1, N)-periodic graphs

Jingyuan Zhang, Fuliang Lu, Xian'an Jin

Let $N \geq 2$ be an integer, a (1, $N$ )-periodic graph $G$ is a periodic graph whose vertices can be partitioned into two sets $V_{1} = {v ∣ σ (v) = v}$ and $V_2=\{v\midσ^i(v)\neq v\ \…

math.CO2020

Laminar Tight Cuts in Matching Covered Graphs

Guantao Chen, Xing Feng, Fuliang Lu +2

An edge cut $C$ of a graph $G$ is {\it tight} if $∣ C \cap M ∣ = 1$ for every perfect matching $M$ of $G$ .~Barrier cuts and 2-separation cuts are called {\it ELP-cuts}, which are two i…

math.CO2019

$b$ -invariant edges in essentially 4-edge-connected near-bipartite cubic bricks

Fuliang Lu, Xing Feng, Yan Wang

A {\em brick} is a non-bipartite matching covered graph without non-trivial tight cuts. Bricks are building blocks of matching covered graphs. We say that an edge $e$ in a brick $G…

math.CO2019

Equivalence classes in matching covered graphs

Fuliang Lu, Nishad Kothari, Xing Feng +1

A connected graph $G$ , of order two or more, is matching covered if each edge lies in some \pema. The tight cut decomposition of a matching covered graph $G$ yields a list of brick…

math.CO2017

Average degrees of edge-chromatic critical graphs

Yan Cao, Guantao Chen, Suyun Jiang +2

Given a graph $G$ , denote by $Δ$ , $d ˉ$ and $χ^{'}$ the maximum degree, the average degree and the chromatic index of $G$ , respectively. A simple graph $G$ is called {\it ed…

math.CO2012

The smallest one-realization of a given set

Ping Zhao, Kefeng Diao, Kaishun Wang

In [The smallest one-realization of a given set, Electronic J. Combin. 19 (2012), $♯$ P19], we determined the minimum number of vertices of one-realizations of a given finite s…