Finding Contents or People

Displaying 501 - 520 of 106881
501 A Note on the p-Prime Algorithm for Solving the Maximum Independent Set Problem Article
502 The Incidence Chromatic Number of Graphs with Maximum Degree Four Article
503 Characterization of a Class of Hamiltonian Connected Graphs Article
504 Locating Chromatic Number of Graphs Article
505 Randomly Dimensional Graphs Article
506 On Vertex-Coloring 2-Edge-Weighting of Graphs Article
507 Some Graphs with Vertex-Coloring 2-Edge Weighting Article
508 2-Trees with Metric Dimension Two Article
509 Chromatic equivalence classes of certain cycles with edges Article
510 Chromatic equivalence classes of certain generalized polygon trees II Article
511 Chromatic equivalence classes of certain generalized polygon trees III Article
512 Smallest defining number of r-regular k-chromatic graphs: r≠k. Ars Combinatoria Article
513 On the defining sets of some special graphs Article
514 On the local colorings of graphs Article
515 Local coloring of the Kneser graphs Article
516 Constructing regular graphs with smallest defining number Article
517 Locally rainbow graphs Article
518 On b-coloring of Kneser graphs Article
519 On construction of involutory MDS matrice from Vandermonde Matrices in GF(2q) Article
520 On the locating chromatic number of Kneser graphs Article