✦ LIBER ✦

A study of the boundary graph classes for colorability problems

✍ Scribed by D. S. Malyshev

Book ID: 120950305
Publisher: Pleiades Publishing
Year: 2013
Tongue: English
Weight: 475 KB
Volume: 7
Category: Article
ISSN: 1990-4789
DOI: 10.1134/S1990478913020117

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Boundary classes of graphs for the domin

Boundary classes of graphs for the dominating set problem

✍ Vladimir E Alekseev; Dmitry V Korobitsyn; Vadim V Lozin 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 210 KB

On the infinity of the set of boundary c

On the infinity of the set of boundary classes for the edge 3-colorability problem

✍ D. S. Malyshev 📂 Article 📅 2010 🏛 Pleiades Publishing 🌐 English ⚖ 457 KB

On the complexity of the selective graph

On the complexity of the selective graph coloring problem in some special classes of graphs

✍ Demange, Marc; Monnot, Jérôme; Pop, Petrica; Ries, Bernard 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 372 KB

Isomorphism problem for a special class

Isomorphism problem for a special class of graphs

✍ D. Ź. Djoković 📂 Article 📅 1970 🏛 Akadmiai Kiad 🌐 English ⚖ 172 KB

Minimizer graphs for a class of extremal

Minimizer graphs for a class of extremal problems

✍ Dan Ismailescu; Dan Stefanica 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 93 KB 👁 2 views

## Abstract We consider the family of graphs with a fixed number of vertices and edges. Among all these graphs, we are looking for those minimizing the sum of the square roots of the vertex degrees. We prove that there is a unique such graph, which consists of the largest possible complete subgraph

Boundary spectral inverse problem on a c

Boundary spectral inverse problem on a class of graphs (trees) by the BC method

✍ Belishev, M I 📂 Article 📅 2004 🏛 Institute of Physics 🌐 English ⚖ 322 KB