位置：成果数据库 > 期刊 > 期刊详情页
Discrete Koszul algebras
  • ISSN号：1386-923X
  • 期刊名称：Algebras and Representation Theory
  • 时间：2012
  • 页码：273-293
  • 相关项目：图的无圈染色和存活率研究
作者： 吕家风|陈淼森|
同期刊论文项目
图的无圈染色和存活率研究
期刊论文 61
同项目期刊论文
Some structural properties of planar graphs and their applications to 3-choosability
A sufficient condition for planar graphs to be acyclically 5-choosable
弱投射模与相伴弱投射模
高度平面图的邻点可区别全染色
Acyclic 6-choosability of planar graphs without adjacent short cycles
An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph
The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle
Linear coloring of planar graphs without 4-cycles
Vertex arboricity of planar graphs without chordal 6-cycles
Acyclic edge coloring of planar graphs without 4-cycles
6-Star-coloring of subcubics graphs
Acyclic chromatic indices of planar graphs with girth at least four
On the vertex-arboricity of planar graphs without 7-cycles
The 2-surviving rate of planar graphs without 4-cycles
Hamiltonian laceability of faulty hypercube
Acyclic chromatic indices of 2-outerplanar graphs
On the firefighter problem of Halin graphs
On a special class of exact sequences
On the closure of quasi-λ-Koszul modules
Piecewise Koszul-type algebras
(p,l)-Koszul modules and modules with linear presentations,
Fault tolerance of augmented cubes
Planar graphs without 4- and 5-cycles are acyclically 4-choosable
Acyclic 4-choosability of planar graphs
The super connectivity of exchanged hypercubes
The Menger number of the Cartesian product of graphs
The domination number of exchanged hypercubes
Highly fault-tolerant routings in some Cartesian product digraphs
The surviving rate of planar graphs
Acyclic list edge coloring of outerplanar graphs
2-外平面图的无圈边色数
A morita equivalence invariance: delta-koszulity
P-CS模的遗传性
On coloring problems
Upper bounds on the linear chromatic number of a graph
The surviving rate of an outerplanar graph for the firefighter problem
Acyclic chromatic indices of planar graphs with large girth
Adjacent vertex distinguishing edge colorings of $K4$-minor free graphs
Entire coloring of plane graphs
The minimum number of dependent arcs in $C_{3k}^3$
Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least 6
Planar graphs of maximum degree six without 7-cycles are class one
A note on general neighbor- distinguishing total coloring of graphs
Planar graphs with maximum degree 5 are 11-linear-colorable
Some results on the injective chromatic number of graphs
Class I graphs of nonnegative characteristic without special cycles
An improved bound on parity vertex colourings of outerplane graphs
8-Star-choosability of a graph with maximum average degree less than 3
Acyclic chromatic indices of planar graphs with girth at least five
(2,1)-Total number of joins of paths and cycles
Vertex-arboricity of planar graphs without intersecting triangles
A new upper bound on the acyclic chromatic indices of planar graphs
On backbone coloring of graphs
A note on the adjacent vertex distinguishing total chromatic number of graphs
The 2-surviving rate of planar graphs without 6-cycles
Linear coloring of plane graphs with girth at least five
Acyclic chromatic indices of $K_{4}$-minor free graphs
Acyclic edge coloring of planar graphs without 5-cycles
韧度与分数（k,n′）-临界消去图