DOIAbstract
AbstractThe graph consisting of s paths joining two vertices is called s-bridge graph. In this paper, we discuss the chromaticity of some families of s-bridge graphs, especially 4-bridge graphs, and some graphs related to s-bridge graphs
AbstractThe graph consisting of s paths joining two vertices is called s-bridge graph. In this paper, we discuss the chromaticity of some families of s-bridge graphs, especially 4-bridge graphs, and some graphs related to s-bridge graphs
We prove that for all integers κ,s≥0 there exists c with the following property. Let G be a graph wi...
Abstract. An S-graph is a graph G which is isomorphic to the complement of.2G Here, we present thre...
For a simple graph G, let P(G?) be the chromatic polynomial of G. Two graphs G and H are said to be ...
AbstractThe graph consisting of s paths joining two vertices is called s-bridge graph. In this paper...
For a graph $G$, let $P(G,\lambda)$ denote the chromatic polynomial of $G$. Two graphs $G$ and $H$ a...
For a graph $G$, let $P(G,\lambda)$ denote the chromatic polynomial of $G$. Two graphs $G$ and $H$ a...
AbstractWe discuss the chromaticity of the graph which consists of a cycle with two crossing chords ...
The concept of [r, s, t]-colourings was recently introduced by Hackmann, Kemnitz and Marangio [3] as...
A class of graphs called generalized ladder graphs is defined. A sufficient condition for pairs of t...
Beginning with the origin of the four color problem in 1852, the field of graph colorings has develo...
A thesis submitted in fulfilment of the requirements for the degree of Master of Science, 2018In thi...
On the chromaticity of certain subgraphs of a q-tree. - In: Journal of graph theory. 13. 1989. S. 59...
AbstractLet Pn∗ denote the graph obtained by joining a new vertex to every vertex of a path on n ver...
Since the introduction of the concepts of chromatically unique graphs and chromatically equivalent ...
AbstractFor a graph G, let P(G,λ) be its chromatic polynomial. Two graphs G and H are chromatically ...
We prove that for all integers κ,s≥0 there exists c with the following property. Let G be a graph wi...
Abstract. An S-graph is a graph G which is isomorphic to the complement of.2G Here, we present thre...
For a simple graph G, let P(G?) be the chromatic polynomial of G. Two graphs G and H are said to be ...
AbstractThe graph consisting of s paths joining two vertices is called s-bridge graph. In this paper...
For a graph $G$, let $P(G,\lambda)$ denote the chromatic polynomial of $G$. Two graphs $G$ and $H$ a...
For a graph $G$, let $P(G,\lambda)$ denote the chromatic polynomial of $G$. Two graphs $G$ and $H$ a...
AbstractWe discuss the chromaticity of the graph which consists of a cycle with two crossing chords ...
The concept of [r, s, t]-colourings was recently introduced by Hackmann, Kemnitz and Marangio [3] as...
A class of graphs called generalized ladder graphs is defined. A sufficient condition for pairs of t...
Beginning with the origin of the four color problem in 1852, the field of graph colorings has develo...
A thesis submitted in fulfilment of the requirements for the degree of Master of Science, 2018In thi...
On the chromaticity of certain subgraphs of a q-tree. - In: Journal of graph theory. 13. 1989. S. 59...
AbstractLet Pn∗ denote the graph obtained by joining a new vertex to every vertex of a path on n ver...
Since the introduction of the concepts of chromatically unique graphs and chromatically equivalent ...
AbstractFor a graph G, let P(G,λ) be its chromatic polynomial. Two graphs G and H are chromatically ...
We prove that for all integers κ,s≥0 there exists c with the following property. Let G be a graph wi...
Abstract. An S-graph is a graph G which is isomorphic to the complement of.2G Here, we present thre...
For a simple graph G, let P(G?) be the chromatic polynomial of G. Two graphs G and H are said to be ...
Add to ORKG