• 1
Book
...Continuing to provide a carefully written, thorough introduction, Graphs & Digraphs, Fifth Edition expertly describes the concepts, theorems, history, and...

• 2
eBook
• 3
Journal Article
by Chartrand, Gary   Zhang, Ping Published in Parallel processing letters (01.09.2020)
...A graph G of order n ≥ 2 is k -uniformly connected for an integer k with 1 ≤ k ≤ n − 1 if for every pair u , v of distinct vertices of G , there is a u − v...
• 4
eBook
by Benjamin, Arthur
[2015]
...Graph theory goes back several centuries and revolves around the study of graphs-mathematical structures showing relations between objects. With applications...
• 5
Journal Article
...A sequence of graphs is a Ramsey sequence if for every positive integer k, the graph Gk is isomorphic to a proper subgraph of and for each positive integer k,...

• 6
Journal Article
by Gary Chartrand   Ping Zhang Published in Discrete Mathematics Letters (11.03.2021)
• 7
eBook
...With Chromatic Graph Theory, Second Edition, the authors present various fundamentals of graph theory that lie outside of graph colorings, including basic...
• 8
Journal Article
• 9
Journal Article
• 10
Journal Article
...For bipartite graphs and and a positive integer , the -bipartite Ramsey number ) of and is the smallest integer with ≥ such that every red-blue coloring of...

• 11
Journal Article
...For an -regular graph , let : ) → [ ] = {1, 2, . . . , }, ≥ 3, be an edge coloring of , where every vertex of is incident with at least one edge of each color...

• 12
Journal Article
...Let be a nontrivial connected, edge-colored graph. An edge-cut of is called a rainbow cut if no two edges in are colored the same. An edge-coloring of is a...

• 13
Journal Article
...An edge coloring of a connected graph G is a proper-path coloring if every two vertices of G are connected by a properly colored path. The minimum number of...
• 14
Journal Article
...For a nontrivial connected graph G, let c: V(G) N be a vertex coloring of G, where adjacent vertices may be colored the same. For a vertex v of G, let N(v)...
• 15
eBook
...Beginning with the origin of the four color problem in 1852, the field of graph colorings has developed into one of the most popular areas of graph theory...
• 16
eBook
...This book is in honor of the 80th birthday of Stephen Hedetniemi. It describes advanced material in graph theory in the areas of domination, coloring, spanning...
• 17
Book
Graphs & digraphs
3. ed., 1. CRC Press repr.

• 18
eBook
by Ping Zhang   Gary Chartrand
28.11.2019
...With Chromatic Graph Theory, Second Edition , the authors present various fundamentals of graph theory that lie outside of graph colorings, including basic...
• 19
Journal Article
by Gary Chartrand Published in Discrete Mathematics Letters (01.05.2019)
• 20
eBook
...Die Theorie der regularen Graphen (The Theory of Regular Graphs), written by the Danish Mathematician Julius Petersen in 1891, is often considered the first...