X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
mathematics (7) 7
pseudoachromatic index (6) 6
mathematics - combinatorics (5) 5
mathematics, applied (4) 4
pseudoachromatic number (4) 4
achromatic number (3) 3
colorings (3) 3
combinatorics (3) 3
achromatic index (2) 2
complete graph (2) 2
engineering design (2) 2
graphs (2) 2
05c15 (1) 1
51e15 (1) 1
achromatic (1) 1
chromatic number (1) 1
coloring (1) 1
combinatorial analysis (1) 1
complete coloring (1) 1
complete colorings (1) 1
complete colourings (1) 1
complete edge-colouring (1) 1
computational geometry (1) 1
computer science (1) 1
connected-pseudoachromatic index (1) 1
dichromatic number (1) 1
discrete mathematics (1) 1
experiment (1) 1
finite affine space (1) 1
finite projective plane (1) 1
geometric graph (1) 1
girth-thickness (1) 1
graph (1) 1
graph colourings (1) 1
graph theory (1) 1
graphs embeddings (1) 1
grundy number (1) 1
hadwiger number (1) 1
high energy physics (1) 1
lower bounds (1) 1
nuclear experiment (1) 1
nuclear theory (1) 1
outerplanar graphs (1) 1
outerthickness (1) 1
perfect graphs (1) 1
planes (1) 1
projective plane (1) 1
projective planes (1) 1
pseudoachromatic (1) 1
segments (1) 1
texts (1) 1
thickness (1) 1
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Discrete Applied Mathematics, ISSN 0166-218X, 11/2017, Volume 231, pp. 60 - 66
A completek-coloring of a graph G is a (not necessarily proper) k-coloring of the vertices of G, such that each pair of different colors appears in an edge. A... 
Complete colorings | Pseudoachromatic index | Hadwiger number | Connected-pseudoachromatic index | Projective plane | MATHEMATICS, APPLIED | Mathematics - Combinatorics
Journal Article
Graphs and Combinatorics, ISSN 0911-0119, 3/2018, Volume 34, Issue 2, pp. 277 - 287
An edge colouring of a graph G is complete if for any distinct colours $$c_1$$ c1 and $$c_2$$ c2 one can find in G adjacent edges coloured with $$c_1$$ c1 and... 
Complete edge-colouring | Pseudoachromatic index | Complete graph | Finite projective plane | Mathematics | Complete colourings | Engineering Design | Combinatorics | 05C15 | 51E15 | MATHEMATICS | ACHROMATIC INDEX | Mathematics - Combinatorics
Journal Article
Graphs and Combinatorics, ISSN 0911-0119, 3/2016, Volume 32, Issue 2, pp. 431 - 451
The pseudoachromatic index of a graph is the maximum number of colors that can be assigned to its edges, such that each pair of different colors is incident to... 
Coloring | Achromatic | Geometric Graph | Mathematics | Engineering Design | Combinatorics | Pseudoachromatic | GRAPH | MATHEMATICS | CHROMATIC NUMBER | Texts | Segments | Graphs | Graph theory | Planes | Combinatorial analysis | Mathematics - Combinatorics
Journal Article
Ars Mathematica Contemporanea, ISSN 1855-3966, 2019, Volume 16, Issue 1, pp. 67 - 79
Lambda line-coloring of the finite affine space AG(n, q) is proper if any two lines from the same color class have no point in common, and it is complete if... 
Pseudoachromatic index | Achromatic index | Complete coloring | Finite affine space | MATHEMATICS | MATHEMATICS, APPLIED | complete coloring | pseudoachromatic index | finite affine space | Mathematics - Combinatorics
Journal Article
Journal of Graph Theory, ISSN 0364-9024, 02/2011, Volume 66, Issue 2, pp. 89 - 97
Let q = 2β be, for some β∈ℕ, and let n = q2 + q+ 1. By exhibiting a complete coloring of the edges of Kn, we show that the pseudoachromatic number ψ(Gn) of the... 
colorings | pseudoachromatic number | MATHEMATICS
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 02/2019, Volume 255, pp. 86 - 97
In this paper, we study the achromatic and the pseudoachromatic numbers of planar and outerplanar graphs as well as planar graphs of girth 4 and graphs... 
Thickness | Graphs embeddings | Outerplanar graphs | Pseudoachromatic number | Girth-thickness | Achromatic number | Outerthickness | MATHEMATICS, APPLIED | PSEUDOACHROMATIC INDEX | Lower bounds | Graphs | Mathematics - Combinatorics
Journal Article
Electronic Journal of Combinatorics, ISSN 1077-8926, 09/2018, Volume 25, Issue 3
We consider the extension to directed graphs of the concept of the achromatic number in terms of acyclic vertex colorings. The achromatic number has been... 
COLORINGS | MATHEMATICS | MATHEMATICS, APPLIED | PSEUDOACHROMATIC INDEX | COMPLETE GRAPH | DICHROMATIC NUMBER | ACHROMATIC NUMBER
Journal Article
Electronic Notes in Discrete Mathematics, ISSN 1571-0653, 2008, Volume 30, Issue C, pp. 105 - 110
Let q = 2 β and n = q 2 + q + 1 . Further, let G = L ( K n ) be the complete line graph and ψ ( G ) its pseudoachromatic number. By exhibiting an explicit... 
Graph colourings | pseudoachromatic number | projective planes
Journal Article
ARS COMBINATORIA, ISSN 0381-7032, 10/2018, Volume 141, pp. 375 - 387
In this paper, we generalize the concept of perfect graphs to other parameters related to graph vertex coloring. This idea was introduced by Christen and... 
COLORINGS | MATHEMATICS | grundy number | perfect graphs | achromatic number | PSEUDOACHROMATIC INDEX | pseudoachromatic number
Journal Article
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.