default search action
Discussiones Mathematicae Graph Theory, Volume 33
Volume 33, Number 1, 2013
- Ewa Drgas-Burchardt
, Mariusz Haluszczak, Maria Kwasnik, Danuta Michalak, Elzbieta Sidorowicz
Preface. 5-6 - Izak Broere, Peter Mihók:
Hereditarnia. 7- - Kinnari Amin, Jill R. Faudree, Ronald J. Gould, Elzbieta Sidorowicz
On the non-(p-1)-partite Kp-free graphs. 9-23 - József Balogh, Alexandr V. Kostochka, Andrei M. Raigorodskii:
Coloring some finite sets in Rn . 25-31 - Izak Broere, Johannes Heidema:
Universality for and in induced-hereditary graph properties. 33-47 - Ewa Drgas-Burchardt
A note on the uniqueness of stable marriage matching. 49-55 - Reinhardt Euler, Pawel Oleksik
When is an incomplete 3× n latin rectangle completable?. 57-69 - Igor Fabrici
On vertices enforcing a Hamiltonian cycle. 71-89 - Anna Fiedorowicz
Acyclic 6-coloring of graphs with maximum degree 5 and small maximum average degree. 91-99 - Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe, Adam Pawel Wojda:
On minimum (Kq, k) stable graphs. 101-115 - Marietjie Frick
A survey of the Path Partition Conjecture. 117-131 - Jochen Harant:
A note on Barnette's Conjecture. 133-137 - Michael A. Henning, Douglas F. Rall
On graphs with disjoint dominating and 2-dominating sets. 139-146 - Mirko Hornák
On maximum weight of a bipartite graph of given order and size. 147-165 - Arnfried Kemnitz, Peter Mihók, Margit Voigt:
Fractional ( P, Q)-total list colorings of graphs. 167-179 - Arnfried Kemnitz, Jakub Przybylo, Ingo Schiermeyer, Mariusz Wozniak:
Rainbow connection in sparse graphs. 181-192 - Justyna Otfinowska, Mariusz Wozniak:
A note on uniquely embeddable forests. 193-201 - Mirka Miller, Joe Ryan, Zdenek Ryjácek:
Distance-locally disconnected graphs. 203-215 - Zdzislaw Skupien:
Sums of powered characteristic roots count distance-independent circular sets. 217-229 - Zsolt Tuza:
Choice-perfect graphs. 231-242
Volume 33, Number 2, 2013
- César Hernández-Cruz
4-transitive digraphs I: the structure of strong 4-transitive digraphs. 247-260 - Marietjie Frick
Independent detour transwersals in 3-deficient digraphs. 261-275 - Wojciech Kordecki, Anna Lyczkowska-Hanckowiak
Exact expectation and variance of minimal basic of random matroids. 277-288 - Xiang'en Chen, Yuping Gao, Bing Yao:
Vertex-distinguishing IE-total colorings of complete bipartite graphs Km, n(m<n). 289-306 - Xueliang Li, Yongtang Shi
On the rainbow vertex-connection. 307-313 - Éric Sopena, Jiaojiao Wu:
The incidence chromatic number of toroidal grids. 315-327 - Richard H. Hammack:
Frucht's theorem for the digraph factorial. 329-336 - Mustapha Chellali, Nader Jafari Rad
Strong equality between the Roman domination and independent Roman domination numbers in trees. 337-346 - Shinya Fujita, Henry Liu:
The balanced decomposition number of TK4 and series -parallel graphs. 347-359 - R. Pandiyaraj, H. P. Patil:
On the total graph of Mycielski graphs, central graphs and their covering numbers. 361-371 - T. Karthick, C. R. Subramanian:
Star coloring subcubic graphs. 373-385 - Michel Mollard:
On domination of Cartesian product of directed cycles: Results for certain equivalence. 387-394 - Mostafa Blidia, Nacéra Meddah:
A characterization of trees for new lower bound on the k-independence number. 395-410 - Bryan Phinezy, Ping Zhang:
On closed modular colorings of trees. 411-428 - Shiying Wang, Ruixia Wang:
Underlying graphs of 3-quasi-transitive digraphs and 3-transitive digraphs. 429-435 - Ronald D. Dutton, William Klostermeyer:
Edge dominating sets and vertex covers. 437-456 - Allan Bickle:
Two short proofs on total domination. 457-459 - Jean-Sébastien Sereni, Zelealem B. Yilma
A tight bound on the set chromatic number. 461-465 - Yota Otachi
The path-distance-width of hypercubes. 467-470
Volume 33, Number 3, 2013
- Ewa Drgas-Burchardt
Preface. 475- - Izak Broere, Johannes Heidema, Peter Mihók:
Universality in graph properties with degree restrictions. 477-492 - Enrique Casas-Bautista
γ-cycles and transivity by monochromatic paths in arc-coloured digraphs. 493-507 - Július Czap
Fractional Q-coloring of graphs. 509-519 - Július Czap
Decompositions of plane graphs under parity constrains given by faces. 521-530 - Reinhardt Euler, Pawel Oleksik
Counting maximal distance-independent sets in grid graphs. 531-557 - Ján Katrenic, Gabriel Semanisin
Maximum semi-matching problem in bipartite graphs. 559-569 - Marián Klesc, Jana Petrillová:
The crossing numbers of products of path with graphs of order six. 571-582 - Marián Klesc, Stefan Schrötter:
On the crossing numbers of Cartesian products of stars and graphs of order six. 583-597 - Wojciech Kordecki, Anna Lyczkowska-Hanckowiak
Broken circuits in matroids-Dohmen's inductive proof. 599-602 - Xueliang Li, Mengmeng Liu, Ingo Schiermeyer:
Rainbow connection number of dense graphs. 603-611 - Hrant Khachatrian
Interval edge-colorings of Cartesian products of graphs I. 613-632
Volume 33, Number 4, 2013
- Gurusamy Rengasamy Vijayakumar:
Characterizations of the family of all generalized line graphs-finite and infinite- and classification of the family of all graphs whose least eigenvalues ≥ -2. 637-648 - Hongyu Liang:
Some sharp bounds on the negative decision number of graphs. 649-656 - Boram Park, Yoshio Sano:
The phylogeny graphs of double partial orders. 657-664 - Gabriela Karafová:
Generalized fractional total coloring of complete graphs. 665-676 - Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson:
Weak saturation numbers for sparse graphs. 677-693 - V. Chitra
Symmetric Hamilton cycle decompositions of complete multigraphs. 695-707 - Lutz Volkmann:
Bounds on the signed 2-independence number in graphs. 709-715 - Hamideh Aram, S. Norouzian, Seyed Mahmoud Sheikholeslami
The distance Roman domination numbers of graphs. 717-730 - Renu C. Laskar, Henry Martyn Mulder
Path-neigborhood graphs. 731-745 - Odile Favaron:
The b-domatic number of a graph. 747-757 - Oleg V. Borodin, Anna O. Ivanova
Precise upper bound for the strong edge chromatic number of sparse planar graphs. 756-770 - Elliot Krop
Almost -rainbow edge-colorings of some small graphs. 771-784 - Jernej Azarija:
Sharp uppper and lower bounds on the number of spanning trees in Cartesian product graphs. 785-790
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-11-22 19:34 CET 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: