Add to ORKG11 p. : il.A graph G is said to be chordless if no cycle in G has a chord. Chordless graphs are exactly the graphs whose line graphs are wheelfree, which implies a connection between the study of the chromatic index of chordless graphs and the study of the chromatic number of wheel-free graphs. Recent works investigate the chromatic index of chordless graphs and prove that every chordless graph with maximum degree at least 3 is Class 1 [?, ?]. In the present work we investigate the total chromatic number of chordless graphs and prove that every chordless graph with maximum degree at least 3 is Type 1
AbstractLet Gn be a graph of n vertices, having chromatic number r which contains no complete graph ...
AbstractCombining recent results on colorings and Ramsey theory, we show that if G is a triangle-fre...
We are given a simple graph G = (V, E). Any edge e ∈ E is a chord in a path P ⊆ G (cycle C ⊆ G) iff ...
International audienceTrotignon and Vuskovic completely characterized graphs that do not contain cyc...
14 p. : il.A unichord is an edge that is the unique chord of a cycle in a graph. The class C of unic...
AbstractA unichord is an edge that is the unique chord of a cycle in a graph. The class C of unichor...
We are given a simple graph G = (V,E). Any edge e ∈ E is a chord in a path P ⊆ G (cycle C ...
AbstractThe relation of chromatic aspects and the existence of certain induced subgraphs of a triang...
14 p. : il.The class C of graphs that do not contain a cycle with a unique chord was recently studie...
International audienceIn this paper, we prove that the class of graphs with no triangle and no induc...
AbstractThe class C of graphs that do not contain a cycle with a unique chord was recently studied b...
International audienceThe b-chromatic number of a graph G is the largest integer k such that G has a...
An acyclic edge coloring of a graph is a proper edge coloring in which there are no bichromatic cycl...
Motivated by a recent conjecture of the first author, we prove that every properly coloured triangle...
AbstractIt is known that the chromatic polynomial of any chordal graph has only integer roots. Howev...
AbstractLet Gn be a graph of n vertices, having chromatic number r which contains no complete graph ...
AbstractCombining recent results on colorings and Ramsey theory, we show that if G is a triangle-fre...
We are given a simple graph G = (V, E). Any edge e ∈ E is a chord in a path P ⊆ G (cycle C ⊆ G) iff ...
International audienceTrotignon and Vuskovic completely characterized graphs that do not contain cyc...
14 p. : il.A unichord is an edge that is the unique chord of a cycle in a graph. The class C of unic...
AbstractA unichord is an edge that is the unique chord of a cycle in a graph. The class C of unichor...
We are given a simple graph G = (V,E). Any edge e ∈ E is a chord in a path P ⊆ G (cycle C ...
AbstractThe relation of chromatic aspects and the existence of certain induced subgraphs of a triang...
14 p. : il.The class C of graphs that do not contain a cycle with a unique chord was recently studie...
International audienceIn this paper, we prove that the class of graphs with no triangle and no induc...
AbstractThe class C of graphs that do not contain a cycle with a unique chord was recently studied b...
International audienceThe b-chromatic number of a graph G is the largest integer k such that G has a...
An acyclic edge coloring of a graph is a proper edge coloring in which there are no bichromatic cycl...
Motivated by a recent conjecture of the first author, we prove that every properly coloured triangle...
AbstractIt is known that the chromatic polynomial of any chordal graph has only integer roots. Howev...
AbstractLet Gn be a graph of n vertices, having chromatic number r which contains no complete graph ...
AbstractCombining recent results on colorings and Ramsey theory, we show that if G is a triangle-fre...
We are given a simple graph G = (V, E). Any edge e ∈ E is a chord in a path P ⊆ G (cycle C ⊆ G) iff ...