block graph
Recently Published Documents


TOTAL DOCUMENTS

33
(FIVE YEARS 4)

H-INDEX

6
(FIVE YEARS 0)

Author(s):  
Julian Brough ◽  
Yanjun Liu ◽  
Alessandro Paolini

Author(s):  
Albert Khachik Sahakyan

List coloring is a vertex coloring of a graph where each vertex can be restricted to a list of allowed colors. For a given graph G and a set L(v) of colors for every vertex v, a list coloring is a function that maps every vertex v to a color in the list L(v) such that no two adjacent vertices receive the same color. It was first studied in the 1970s in independent papers by Vizing and by Erdős, Rubin, and Taylor. A block graph is a type of undirected graph in which every biconnected component (block) is a clique. A complete bipartite graph is a bipartite graph with partitions V 1, V 2 such that for every two vertices v_1∈V_1 and v_2∈V_2 there is an edge (v 1, v 2). If |V_1 |=n and |V_2 |=m it is denoted by K_(n,m). In this paper we provide a polynomial algorithm for finding a list coloring of block graphs and prove that the problem of finding a list coloring of K_(n,m) is NP-complete even if for each vertex v the length of the list is not greater than 3 (|L(v)|≤3).


2020 ◽  
Vol 591 ◽  
pp. 284-298
Author(s):  
Jie Xue ◽  
Huiqiu Lin ◽  
Jinlong Shu
Keyword(s):  

Author(s):  
A. Kelkar ◽  
K. Jaysurya ◽  
H.M. Nagesh

The block graph of a graph $G$, written $B(G)$, is the graph whose vertices are the blocks of $G$ and in which two vertices are adjacent whenever the corresponding blocks have a cut-vertex in common. We study the properties of $B(G)$ and present the characterization of graphs whose $B(G)$ are planar, outerplanar, maximal outerplanar, minimally non-outerplanar, Eulerian, and Hamiltonian. A necessary and sufficient condition for $B(G)$ to have crossing number one is also presented.


IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 22966-22975 ◽  
Author(s):  
Chenlong Yang ◽  
Xiangxue Li ◽  
Yu Yu ◽  
Ziping Wang
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document