A Map Coloring Method  

A Map Coloring Method

在线阅读下载全文

作  者:Shijun Han Shijun Han(Agricultural Bank of China Puyang Branch, Puyang, China)

机构地区:[1]Agricultural Bank of China Puyang Branch, Puyang, China

出  处:《Journal of Applied Mathematics and Physics》2023年第4期1200-1208,共9页应用数学与应用物理(英文)

摘  要:Different vertices are colored in a plan. Adjacent vertices are colored dif-ferently from nonadjacent vertices, which are colored the same color. One color is used for a single point, two colors are used for points without a loop, and a maximum of four colors are used for points with a loop. A maximum of four colors are used to color all points. .Different vertices are colored in a plan. Adjacent vertices are colored dif-ferently from nonadjacent vertices, which are colored the same color. One color is used for a single point, two colors are used for points without a loop, and a maximum of four colors are used for points with a loop. A maximum of four colors are used to color all points. .

关 键 词:MAP Four Colors Four Colors Conjecture Graph Theory 

分 类 号:O15[理学—数学]

 

参考文献:

正在载入数据...

 

二级参考文献:

正在载入数据...

 

耦合文献:

正在载入数据...

 

引证文献:

正在载入数据...

 

二级引证文献:

正在载入数据...

 

同被引文献:

正在载入数据...

 

相关期刊文献:

正在载入数据...

相关的主题
相关的作者对象
相关的机构对象