EUDML

Currently displaying 1 – 8 of 8

Order by Relevance | Title | Year of publication

Bifurcations of finite difference schemes and their approximate inertial forms

Rolf Bronstering; Min Chen — 1998

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

Incremental unknowns for solving partial differential equations.

Min Chen; Roger Temam — 1991

Numerische Mathematik

Nonlinear Galerkin method in the finite difference case and wavelet-like incremental unknowns.

Min Chen; Roger Temam — 1993

Numerische Mathematik

Acyclic 4-choosability of planar graphs without 4-cycles

Yingcai Sun; Min Chen — 2020

Czechoslovak Mathematical Journal

A proper vertex coloring of a graph $G$ is acyclic if there is no bicolored cycle in $G$ . In other words, each cycle of $G$ must be colored with at least three colors. Given a list assignment $L = {L (v) : v \in V}$ , if there exists an acyclic coloring $π$ of $G$ such that $π (v) \in L (v)$ for all $v \in V$ , then we say that $G$ is acyclically $L$ -colorable. If $G$ is acyclically $L$ -colorable for any list assignment $L$ with $| L (v) | \geq k$ for all $v \in V$ , then $G$ is acyclically $k$ -choosable. In 2006, Montassier, Raspaud and Wang conjectured that every planar graph without 4-cycles...