TRIANGLES

作品数：58被引量：69H指数：4
导出分析报告
相关领域：理学更多>>
相关作者：谭昌汇燕飞潘懋郭艳军王喆更多>>
相关机构：北京大学四川国际标榜职业学院香港大学镇江师范专科学校更多>>
相关期刊：《Surgical Science》《Journal of Computational Mathematics》《程序员（游戏创造）》《Medical Bulletin of Shanghai Jiaotong University》更多>>
相关基金：国家自然科学基金国家重点基础研究发展计划更多>>
-
在结果中检索

检索结果分析

结果分析中...
选择条件：
  • 主题=WITHOUTx
共 条 记 录，以下是1-4
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
The acyclic chromatic index of planar graphs without 4-,6-cycles and intersecting triangles
《Frontiers of Mathematics in China》2024年第3期117-136,共20页Yuehua BU Qi JIA Hongguo ZHU 
A proper edge k-coloring is a mappingΦ:E(G)-→{1,2,...,k}such that any two adjacent edges receive different colors.A proper edge k-coloringΦof G is called acyclic if there are no bichromatic cycles in G.The acyclic ...
关键词：Acyclic edge coloring plane graph CYCLE 
Distance-Regular Graphs of Diameter 3Without Triangles with c_(2)=2
《Communications in Mathematics and Statistics》2022年第4期785-792,共8页A.A.Makhnev Wenbin Guo K.S.Efimov 
supported by the RFBR and the NFSC(Project No.20-51-53013);supported by the NNSF of China(No.12171126).
Earlier it was proved that some distance-regular graphs of diameter 3 with c_(2)=2 do not exist.Distance-regular graphΓwith intersection array{17,16,10;1,2,8}has strongly regular graphΓ_(3)(pseudo-geometric graph fo...
关键词：Distance-regular graph Graph without triangles Triple intersection numbers 
Acyclic Edge Coloring of Planar Graphs without Adjacent Triangles被引量：3
《Journal of Mathematical Research with Applications》2012年第4期407-414,共8页DezhengXIE YanqingWU 
An acyclic edge coloring of a graph G is a proper edge coloring such that there are no bichromatic cycles.The acyclic edge chromatic number of a graph G is the minimum number k such that there exists an acyclic edge c...
关键词：acyclic edge coloring acyclic edge chromatic number planar graph. 
List Total Colorings of Planar Graphs without Triangles at Small Distance被引量：1
《Acta Mathematica Sinica,English Series》2011年第12期2437-2444,共8页Bin LIU Jian Feng HOU Gui Zhen LIU 
Suppose that G is a planar graph with maximum degree △. In this paper it is proved that G is total-（△ ＋ 2）-choosable if （1） △ ≥ 7 and G has no adjacent triangles （i.e., no two triangles are incident with a c...
关键词：List total coloring CHOOSABILITY planar graph 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部