位置：成果数据库 > 期刊 > 期刊详情页
The clique-transversal number of a {K1,3,K4}-free 4-regular graph
  • ISSN号：0012-365X
  • 期刊名称：Discrete Mathematics
  • 时间：2015
  • 页码：1126-1130
  • 相关项目：图的双临猜想及相关的着色问题
作者： Fenling Xu|Baoyindureng Wu|Qinqin Li|
同期刊论文项目
图的双临猜想及相关的着色问题
期刊论文 35
同项目期刊论文
图的列表点荫度
On Reichenbach's causal Betweenness
Hamiltonicity of transformation graph G+--
Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree
群着色的Hadwiger型猜想的否定
半径为二的图的维纳指标
Supereulerian graphs with small circumference and 3-connected hamiltonian claw-free graphs
More bounds for the Grundy number of graphs
Maximum size of digraphs with some parameters
On the distance and distance Laplacian eigenvalues of graphs
Outer-connected domination in 2-connected cubic graphs
Average distance, radius and remoteness of a graph
Star decomposition of graphs
A Weaker version of a conjecture on list vertex arboricity of graphs
Two-log-convexity of the Catalan-Larcombe-French sequence
Domination of maximal K_4-minor free graphs and maximal K_2,3-minor free graphs, and disproofs of tw
[1,2]-domination in graphs
The hub number, girth and Mycielski graphs
Disproof of the group coloring version of the Hadwiger conjecture
The weighted version of the handshaking lemma with an application
Randic index and coloring number of graphs
The hub number, girth and Mycielski grpahs
2-Edge connected dominating sets and 2-Connecteddominating sets of a graph
Proximity and average eccentricity of a graph
Randi？ index and coloring number of a graph