Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscussiones Mathematicae Graph Theory, Volume 34
Volume 34, Number 1, 2014
- Eric Andrews, Futaba Fujie, Kyle Kolasinski, Chira Lumduanhom, Adam Yusko:
On monochromatic subgraphs of edge-colored complete graphs. 5-22 - Ioan Tomescu
:
Hypergraphs with pendant paths are not chromatically unique. 23-29 - Sagnik Sen:
L(2, 1)-labelings of some famillies of oriented planar graphs. 31-48 - Wei Li, Shunyi Liu, Heping Zhang:
A note on the permanental roots of bipartite graphs. 49-56 - Carlos A. Araújo, Italo J. Dejter:
Lattice-like perfect codes. 57-74 - Jaroslav Ivanco, Tatiana Polláková:
Supermagic graphs having a saturated vertex. 75-84 - David Offner:
Packing the hypercube. 85-93 - Hong-Hai Li, Li Su, Jing Zhang:
The minimum spetral radius of signless Laplacian of graphs with a given clique number. 95-102 - Hong-Hai Li, Li Su, Jing Zhang:
On the determinant of q-distance matrix of a graph. 103-111 - Atif A. Abueida, Chester Lian:
On the decompositions of complete graphs into cycles and stars on the same number of edges. 113-125 - Erfang Shan, Dingguo Wang:
On the numbers of cut-vertices and end-blocks in 4-regular graphs. 127-136 - Tanja Gologranc:
Tree-like partial Hamming graphs. 137-150 - Jaehoon Kim, Alexandr V. Kostochka:
Maximum hypergraphs without regular subgraphs. 151-166 - Pavol Hell, César Hernández-Cruz:
On the complexity of the 3-kernel problem in some classes of digraphs. 167-185 - Martin Knor:
Smallest regular graphs of given degree and diameter. 187-191 - Yoshimi Egawa, Mikio Kano, Zheng Yan:
Star-cycle factors of graphs. 193-198 - András Gyárfás:
Packing trees into n-chromatic graphs. 199-201
Volume 34, Number 2, 2014
- Biswajit Deb, Kalpesh Kapoor:
Motion planning in Cartesian product graphs. 207-221 - Mohammed S. A. Bataineh, M. S. Bateeha, Mohammed M. M. Jaradat:
The Ramsey number for theta graph versus a clique of order three and four. 223-232 - Christina M. Mynhardt, Mark Schurch:
The depression of a graph and k-kernels. 233-247 - Tomoki Nakamigawa:
A Ramsey-type theorem for multiple disjoint copies of induced subgraphs. 249-261 - Hosam Abdo, Darko Dimitrov:
The irregularity of graphs under graph operations. 263-278 - Subramanian Arumugam, Nainarraj Kamatchi, Gurusamy Rengasamy Vijayakumar:
On the uniqueness of D-vertex magic constant. 279-286 - Hajo Broersma, Binlong Li, Shenggui Zhang:
Heavy subgraph pairs for traceability of block-chains. 287-307 - Jobby Jacob, Darren A. Narayan, Peter Richter, Emily Sergel, Anh Tran:
Rank numbers for bent ladders. 309-329 - Alexander Halperin, Colton Magnant, Kyle Pula:
A decomposition of Gallai multigraphs. 331-352 - Jeongmi Park, Yoshio Sano:
The niche graphs of interval orders. 353-359 - Vojtech Rödl, Andrzej Rucinski:
Families of triples with high minimum degree are Hamiltonian. 361-381 - Yannis Manoussakis, H. P. Patil:
On degree sets and the minimum orders in bipartite graphs. 383-390 - Eric Andrews, Chira Lumduanhom, Ping Zhang:
On Eulerian irregularity in graphs. 391-408 - Jinfeng Liu, Xiumei Wang:
A note on PM-compact bipartite graphs. 409-413 - Ian Short:
Maximal buttonings of trees. 415-420 - Stanislav Jendrol', Peter Sugerek:
A note on face coloring entire weightings of plane graphs. 421-426
Volume 34, Number 3, 2014
- Hortensia Galeana-Sánchez, César Hernández-Cruz:
On the existence of (k, l)-kernels in infinite digraphs: A survey. 431-466 - Kunal Dutta, C. R. Subramanian:
Induced acyclic tournaments in random digraphs: Sharp concentration, thresholds and algorithms. 467-495 - Lidia Badura:
Two graphs with a common edge. 497-507 - David E. Brown, Breeann Flesch, J. Richard Lundgren:
A characterization of 2-tree probe interval graphs. 509-527 - J. Balakumar, S. Monikandan:
A reduction of the Graph Reconstruction Conjecture. 529-537 - Oleg V. Borodin, Anna O. Ivanova, Tommy R. Jensen:
5-stars of low weight in normal plane maps with minimum degree 5. 539-546 - Julian A. Allagan, David Slutzky:
Chromatic polynomials of mixed hypercycles. 547-558 - Changiz Eslahchi, Shahab Haghi, Nader Jafari Rad:
Characterization of cubic graphs G with irt(G)=IRt(G)=2. 559-565 - Mohsen Ghasemi:
Tetravalent arc-transitive graphs of order 3p2. 567-575 - Lianying Miao, Zhengke Miao, Shiyou Pang, Wenyao Song:
On the independence number of edge chromatic critical graphs. 577-584 - Allan Bickle:
Degree sequences of monocore graphs. 585-592 - Pablo De Caria, Terry A. McKee:
Maxclique and unit disk characterizations of strongly chordal graphs. 593-602 - Teresa W. Haynes, Stephen T. Hedetniemi, William B. Jamieson, Jessie D. Jamieson:
Downhill domination in graphs. 603-612 - Eric Andrews, Laars Helenius, Daniel Johnston, Jonathon VerWys, Ping Zhang:
On twin edge colorings of graphs. 613-627 - John P. Georges, Jianwei Lin, David W. Mauro:
The domination number of Kn3. 629-632 - Landon Rabern:
A different short proof of Brook's theorem. 633-634 - Khodakhast Bibak, Hossein Esfandiari, Pouria Salehi Nowbandegani, Mohammad Hassan Shirdareh Haghighi:
On the Erdös-Gyárfás conjecture in claw-free graphs. 635-640 - Martin Trinks:
A note on a broken-cycle theorem for hypergraphs. 641-646
Volume 34, Number 4, 2014
- César Hernández-Cruz, Juan José Montellano-Ballesteros:
On the structure of strong k-transitive digraphs. 651-671 - Terry A. McKee:
Pairs of edges as chords and as cut-edges. 673-681 - Michitaka Furuya:
The connectivity of domination dot-critical graphs with no critical vertices. 683-690 - Muhammad Javaid:
On super edge-antimagic total labeling of subdivided stars. 691-705 - Chandrashekar Adiga, E. Sampathkumar, M. A. Sriraj:
Color energy of a unitary Cayley graph. 707-721 - Gerard Jennhwa Chang, Mickaël Montassier, Arnaud Pêcher, André Raspaud:
Strong chromatic index of planar graphs with large girth. 723-733 - Hongyan Lu, Jing Luo, Zhongxun Zhu:
Extremal unicyclic graphs with minimal distance spectral radius. 735-750 - Ali Reza Ashrafi, Morteza Faghani, Gyula Y. Katona:
Centrosymmetric graphs and a lower bound for graph energy of fullerenes. 751-768 - Daniel W. Cranston, Sogol Jahanbekam, Douglas B. West:
The 1, 2, 3-Conjecture and 1, 2-Conjecture for sparse graphs. 769-799 - Junqing Cai, Hao Li, Wantao Ning:
An implicit weighted degree condition for heavy cycles. 801-810 - Isaac Birnbaum, Megan Kuneli, Robyn McDonald, Katherine Urabe, Oscar Vega:
The well-covered dimension of products of graphs. 811-827 - KM. Kathiresan, G. Marimuthu, C. Parameswaran:
Characterization of super-radial graphs. 829-848 - Igor Fabrici, Jochen Harant, Stanislav Jendrol', Roman Soták:
A note on vertex colorings of plane graphs. 849-855 - Michal Adamaszek:
The smallest nonevasive graph property. 857-862
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:
