Results 251 to 260 of about 44,462 (291)

Characterizing Puree Bite Sizes in People with Normal and Disordered Swallowing: Predictors and Impact on Swallowing Safety and Efficiency during Flexible Endoscopic Evaluation of Swallowing.

Folia Phoniatr Logop
Curtis JA, Kocins K, Rameau A, Clark CM, Mocchetti V.   +4 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Total Colorings of Degenerated Graphs

Combinatorica, 2001
A total coloring of a graph G is a coloring of all elements of G, i.e. vertices and edges, such that no two adjacent or incident elements receive the same color. A graph G is s-degenerate for a positive integer s if G can be reduced to a trivial graph by successive removal of vertices with degree ≤s.
Shuji Isobe, Xiao Zhou 0001, Takao Nishizeki   +2 more
openaire   +1 more source

Total colorings of circulant graphs

Discrete Mathematics, Algorithms and Applications, 2020
The total chromatic number [Formula: see text] is the least number of colors needed to color the vertices and edges of a graph [Formula: see text] such that no incident or adjacent elements (vertices or edges) receive the same color. Behzad and Vizing proposed a well-known total coloring conjecture (TCC): [Formula: see text], where [Formula: see text]
J. Geetha 0001, K. Somasundaram 0001, Hung-Lin Fu   +2 more
openaire   +2 more sources

Total Colorings of Graphs with Minimum Sum of Colors

Graphs and Combinatorics, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ewa M. Kubicka, Grzegorz Kubicki, Maxfield Leidner   +2 more
openaire   +1 more source

Total Colorings of Product Graphs

Graphs and Combinatorics, 2018
A proper total coloring of a graph \(G\) is an assignment of colors to vertices and edges of the graph, such that adjacent and incident elements receive different colors. The total chromatic number \(\chi^{\prime\prime}(G)\) of the graph \(G\) is the minimum number of colors needed for a proper total coloring.
J. Geetha 0001, K. Somasundaram 0001
openaire   +2 more sources

Uniquely Total Colorable Graphs

Graphs and Combinatorics, 1997
A total coloring of a graph is an assignment of colors to the vertices and edges of the graph so that no two adjacent edges have the same color, no two adjacent vertices have the same color and no vertex and an incident edge have the same color. The minimum number of colors needed by a total coloring is called the total chromatic number and is denoted \
Saieed Akbari, Mehdi Behzad, Hossein Hajiabolhassan, Ebadollah S. Mahmoodian   +3 more
openaire   +2 more sources

Total coloring of the prismatic graphs

Discrete Mathematics, Algorithms and Applications, 2020
A total coloring of a graph is an assignment of colors to all the elements of the graph such that no two adjacent or incident elements receive the same color. A graph [Formula: see text] is prismatic, if for every triangle [Formula: see text], every vertex not in [Formula: see text] has exactly one neighbor in [Formula: see text].
S. Mohan, K. Somasundaram 0001
openaire   +2 more sources

Totally symmetric colored graphs

Journal of Graph Theory, 2009
AbstractIn this paper we describe almost all edge‐colored complete graphs that are fully symmetric with respect to colors and transitive on every set of edges of the same color. This generalizes the recent description of self‐complementary symmetric graphs by Peisert and gives examples of permutation groups that require more than 5 colors to be ...
Mariusz Grech, Andrzej Kisielewicz 0001
openaire   +1 more source