Liwu Li, T. A. MarslandAuthors Info & ClaimsA ( c 1 , c 2 , , c k ) -coloring of G is a mapping : V ( G ) { 1 , 2 , , k } such that for every i , 1 i k , G V i has maximum degree at most c i , where G V i denotes the subgraph induced by the vertices colored i . Borodin and Raspaud conjecture that ...
A bipartite graph G=(A,B,E) is convex on B if there exists an ordering of the vertices of B such that for any vertex vźA, vertices adjacent to v are consecutive in B. A complete bipartite subgraph of a graph G is called a biclique of G. Motivated by an ...
An i-triangulated graph is a graph in which every odd cycle has two non-crossing chords; i-triangulated graphs form a subfamily of perfect graphs. A slightly more general family of perfect graphs are clique-separable graphs. A graph is clique-separable ...
Association for Computing Machinery
New York, NY, United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in