The study of vertex critical graphs
碩士 === 淡江大學 === 數學學系 === 91 === A graph G is an order pair (V , E),where V is a nonempty finite set, called vertex set, and E is a subset of two elements set of V, called edge set. The vertex coloring of G is a coloring on the vertices of G such that two adjacent vertices are colored different color...
Main Authors: | Chong-Ren Guo, 郭崇人 |
---|---|
Other Authors: | Chin-Mei Kau Fu |
Format: | Others |
Language: | zh-TW |
Published: |
2003
|
Online Access: | http://ndltd.ncl.edu.tw/handle/10359315226454565075 |
Similar Items
-
Vertex-criticality of the domination parameters of graphs
by: Roux, Adriana
Published: (2011) -
On b-vertex and b-edge critical graphs
by: Noureddine Ikhlef Eschouf, et al.
Published: (2015-01-01) -
Independent Roman Domination Stable and Vertex-Critical Graphs
by: Pu Wu, et al.
Published: (2018-01-01) -
Vertex Ranking of Graphs
by: Nancy N.H. Teng, et al.
Published: (2007) -
Vertex sequences in graphs
by: Teresa W. Haynes, et al.
Published: (2021-03-01)