Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscussiones Mathematicae Graph Theory, Volume 30
Volume 30, Number 1, 2010
- Edgar G. DuCasse, Michael L. Gargano, Louis V. Quintas:
Value sets of graphs edge-weighted with elements of a finite abelian group. 5-15 - Bostjan Bresar, Manoj Changat, Ajitha R. Subhamathi, Aleksandra Tepeh Horvat:
The periphery graph of a median graph. 17-32 - S. Arumugam, Kalimuthu Karuppasamy, Ismail Sahul Hamid:
Fractional global domination in graphs. 33-44 - Grady Bullington, Linda Eroh, Steven J. Winters:
γ-labelings of complete bipartite graphs. 45-54 - A. P. Santhakumaran, S. V. Ullas Chandran
:
The edge geodetic number and Cartesian product of graphs. 55-73 - Kumarappan Kathiresan, G. Marimuthu:
Futher results on radial graphs. 75-83 - Lin Cui, Yi-Zheng Fan:
The signless Laplacian spectral radius of graphs with given number of cut vertices. 85-93 - Sylwia Cichacz, Jakub Przybylo:
Vertex-distinquishing edge-colorings of linear forests. 95-103 - Erfang Shan, Yancai Zhao:
On characterization of uniquely 3-list colorable complete multipartite graphs. 105-114 - Jana Zlámalová:
A note on cyclic chromatic number. 115-122 - Mahdieh Hasheminezhad, Brendan D. McKay:
Recursive generation of simple planar quadrangulations with vertices of degree 3 and 4. 123-136 - Futaba Okamoto, Ebrahim Salehi, Ping Zhang:
On multiset colorings of graphs. 137-153 - S. Athisayanathan, A. P. Santhakumaran:
On edge detour graphs. 155-174
- Jerzy A. Filar, Michael Haythorpe, Giang T. Nguyen:
A conjecture on the prevalence of cubic bridge graphs. 175-179
Volume 30, Number 2, 2010
- Xinmin Hou, You Lu, Jun-Ming Xu:
On the (2, 2)-domination number of trees. 185-199 - Ruxandra Marinescu-Ghemeci:
Radio number for some thorn graphs. 201-222 - Mustapha Chellali, Malika Mimouni, Peter J. Slater:
On locating-domination in graphs. 223-235 - Zuo-Li Chen, Jin-Feng Lv, Yufa Shen, Guoping Zheng:
On choosability of complete multipartite graphs K4, 3*t, 2*(k-2t-2), 1*(t+1). 237-244 - Jill R. Faudree, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Colton Magnant:
Chvátal-Erdös type theorems. 245-256 - Magdalena Lemanska:
Nordhaus-Gaddum results for weakly convex domination number of a graph. 257-263 - Mustapha Chellali, Teresa W. Haynes, Lutz Volkmann:
k-independence stable graphs upon edge removal. 265-274 - A. Pawel Wojda:
Preface. 275-276 - Sarah Artmann, Jochen Harant:
Random procedures for dominating sets in bipartite graphs. 277-288 - Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe:
On family of cubic graphs containing flower snarks. 289-314 - Jean-Luc Fouquet, Jean-Marie Vanherpe:
Mácajová and Skoviera conjecture on cubic graphs. 315-333 - Jaroslav Ivanco:
Decompositions of multigraphs into parts with the same size. 335-347 - Pavla Kabelíková:
Graph centers used for stabilization of matrix factorizations. 349-359
Volume 30, Number 3, 2010
- Manju K. Menon, Ambat Vijayakumar:
The edge C4 graph of some graph classes. 365-375 - Joanna Cyman:
Total outer-connected domination in trees. 377-383 - Rangaswami Balakrishnan, T. Kavaskar:
Fall coloring of graphs I. 385-391 - Csilla Bujtás, Charles Dominic, E. Sampathkumar, M. S. Subramanya, Zsolt Tuza:
3-consecutive C-colorings of graphs. 393-405 - K. Reji Kumar, Gary MacGillivray:
Structure of the set of all minimal total dominating functions of some classes of graphs. 407-423 - Xinmin Hou, Ning Li, You Lu, Jun-Ming Xu:
A characterization of (γt, γ2)-trees. 425-435 - Renata Kawa:
Graphs for n-circular matroids. 437-447 - Suh-Ryung Kim, Boram Park, Yoshio Sano:
The competition numbers of Johnson graphs. 449-459 - Wilfried Imrich, Werner Klöckl:
Factoring directed graphs with respect to the cardinal product in polynomial time II. 461-474 - Ermelinda DeLaViña, Ryan Pepper, Bill Waller:
Lower bounds for the domination number. 475-487 - Rangaswami Balakrishnan, S. Francis Raj:
The Wiener number of powers of the Mycielskian. 489-498 - Elzbieta Sidorowicz:
Colouring game and generalized colouring game on graphs with cut-vertices. 499-533
Volume 30, Number 4, 2010
- Gurusamy Rengasamy Vijayakumar:
Arithmetic labelings and geometric labelings of countable graphs. 539-544 - Hortensia Galeana-Sánchez, Rocío Rojas-Monroy, B. Zavala:
Monochromatic paths and monochromatic sets of arcs in quasi-transitive digraphs. 545-553 - Izolda Gorgol, Ewa Lazuka:
Rainbow numbers for small stars with one edge added. 555-562 - Michael A. Henning, Christian Löwenstein, Dieter Rautenbach:
Partitioning a graph into a dominating set, a total dominating set, and something else. 563-574 - Richard H. Hammack, Katherine E. Toman:
Cancellation of direct products of digraphs. 575-590 - David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein:
On the existence of a cycle of length at least 7 in a (1, \le 2)-twin-free graph. 591-609 - Odile Favaron, Hossein Karami, Rana Khoeilar, Seyed Mahmoud Sheikholeslami:
Matchings and total domination subdivision number in graphs with few induced 4-cycles. 611-618 - Geir Agnarsson, Magnús M. Halldórsson:
Vertex coloring the square of outerplanar graphs of low degree. 619-636 - Edy Tri Baskoro, Tomás Vetrík, Lyra Yulianti:
On Ramsey (K1, 2, C4)-minimal graphs. 637-649 - Terry A. McKee:
Clique graph representations of ptolemaic graphs. 651-661 - Aneta Dudek, Andrzej Zak:
On vertex stability with regard to complete bipartite subgraphs. 663-669 - Manoj Changat, Joseph Mathews, Prasanth G. Narasimha-Shenoi, Iztok Peterin:
n-ary transit functions in graphs. 671-685 - A. P. Santhakumaran, S. V. Ullas Chandran:
The geodetic number of strong product graphs. 687-700 - Magdalena Bojarska:
A note on Hamiltonian cycles in generalized Halin graphs. 701-704 - Giuseppe Mazzuoccolo:
The NP-completeness of authomorphic colorings. 705-710
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 20:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
