位置：成果数据库 > 期刊 > 期刊详情页
Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs
  • ISSN号：0020-7160
  • 期刊名称：International Journal of Computer Mathematics
  • 时间：2014.8
  • 页码：1662-1672
  • 相关项目：图的边染色与几类参数的研究
作者： Ping Li|Zhengke Miao|Keke Wang|Hong-Jian Lai|
同期刊论文项目
图的边染色与几类参数的研究
期刊论文 42
同项目期刊论文
Strong List Edge Coloring of Subcubic Graphs
Plane graphs with maximum degree △ ≥ 8 are entirely (△ + 3)-colorable
Adjacent Vertex Distinguishing edge coloring of 2-degenerate graphs
On the independence number of edge chromatic critical graphs
On strongly Z2s+1-connected graphs
On the size of critical graphs with small maximum degree
The extremal primitive digraph with both Lewin index n？2 and girth 2 or 3
On strong list edge coloring of subcubic graphs
Adjacent vertex distinguishing indices of planar graphs without 3-cycles
Graphic sequences with an A-Connected realization
A note on an extremal problem for group connectivity
A sufficient condition for edge chromatic critical graphs to be Hamiltonian -- An approach to Vizing
An extremal problem on A-connected graphs
Nowhere-zero 3-flows of graphs with prescribed sizes of odd edge cuts
Lumping algorithms for computing Google's PageRank and its derivative, with attention to unr
On the local base of a primitive and nonpowerful sign pattern
Hamilton Circuits and Essential Girth of Claw Free Graphs
A sufficient condition for a tree to be (Δ+1)-(2,1)-totally labelable,
Neighbor sum distinguishing edge colorings of sparse graphs
Finding Delta for a Surface of Characteristic ？4
VECTOR FLOWS AND INTEGER FLOWS
Unique Fulkerson coloring of Petersen minor-free cubic graphs
Every planar graph with cycles of length neither 4 nor 5 is (1, 1, 0)-colorable
Plane graphs with maximum degree △ ≥ 8 are entirely (△ + 3)-colorable
A sufficient condition for edge chromatic critical graphs to be Hamiltonian-- An approach to Vizing&
Circuit extension and circuit double cover of graphs
Nowhere-zero 3-flow of graphs with independence number two
Sufficient conditions for a planar graph to be list edge Δ-colorable and list totally (Δ + 1)-colora
Strong Circuit Double Cover of Some Cubic Graphs,
k-色斜Dyck路的计数