Equitable total-coloring of subcubic graphs (English)
- New search for: Gui, H.
- New search for: Wang, W.
- New search for: Wang, Y.
- New search for: Zhang, Z.
- New search for: Gui, H.
- New search for: Wang, W.
- New search for: Wang, Y.
- New search for: Zhang, Z.
In:
DISCRETE APPLIED MATHEMATICS
;
184
;
167-170
;
2015
-
ISSN:
- Article (Journal) / Print
-
Title:Equitable total-coloring of subcubic graphs
-
Contributors:
-
Published in:DISCRETE APPLIED MATHEMATICS ; 184 ; 167-170
-
Publisher:
- New search for: Elsevier Science B.V., Amsterdam.
-
Publication date:2015-01-01
-
Size:4 pages
-
ISSN:
-
Type of media:Article (Journal)
-
Type of material:Print
-
Language:English
- New search for: 510
- Further information on Dewey Decimal Classification
-
Classification:
DDC: 510 -
Source:
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Table of contents – Volume 184
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
A decomposition of the space of TU-games using addition and transfer invarianceBéal, Sylvain / Rémila, Eric / Solal, Philippe et al. | 2014
- 14
-
Asymptotic surviving rate of trees with multiple fire sourcesCosta, Vitor / Dantas, Simone / Rautenbach, Dieter et al. | 2014
- 20
-
The worst case number of questions in Generalized AB game with and without white-peg answersJäger, Gerold / Peczarski, Marcin et al. | 2014
- 32
-
The minimum number of minimal codewords in an -code and in graphic codesAlahmadi, A. / Aldred, R.E.L. / de la Cruz, R. / Ok, S. / Solé, P. / Thomassen, C. et al. | 2014
- 40
-
The chromatic discrepancy of graphsAravind, N.R. / Kalyanasundaram, Subrahmanyam / Sandeep, R.B. / Sivadasan, Naveen et al. | 2014
- 50
-
Efficiently decomposing, recognizing and triangulating hole-free graphs without diamondsBerry, Anne / Brandstädt, Andreas / Giakoumakis, Vassilis / Maffray, Frédéric et al. | 2014
- 62
-
New bounds of degree-based topological indices for some classes of -cyclic graphsBianchi, Monica / Cornaro, Alessandra / Palacios, José Luis / Torriero, Anna et al. | 2014
- 76
-
Diagnosis of constant faults in read-once contact networks over finite basesBusbait, Monther / Chikalov, Igor / Hussain, Shahid / Moshkov, Mikhail et al. | 2014
- 89
-
Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patternsCooper, Martin C. / Escamocher, Guillaume et al. | 2014
- 114
-
Computational complexity of minimum vertex cover problem for regular and -free graphsSafina Devi, N. / Mane, Aniket C. / Mishra, Sounaka et al. | 2014
- 122
-
Domination, coloring and stability in -reducible graphsFouquet, Jean-Luc / Maffray, Frédéric et al. | 2014
- 130
-
Parameterized clique on inhomogeneous random graphsFriedrich, Tobias / Krohmer, Anton et al. | 2014
- 139
-
Pebble exchange on graphsFujita, Shinya / Nakamigawa, Tomoki / Sakuma, Tadashi et al. | 2013
- 146
-
The probabilistic approach to limited packings in graphsGagarin, Andrei / Zverovich, Vadim et al. | 2014
- 154
-
Approximate tradeoffs on weighted labeled matroidsGourvès, Laurent / Monnot, Jérôme / Tlilane, Lydia et al. | 2014
- 167
-
Equitable total-coloring of subcubic graphsGui, Hao / Wang, Weifan / Wang, Yiqiao / Zhang, Zhao et al. | 2014
- 171
-
Domination versus disjunctive domination in treesHenning, Michael A. / Marcon, Sinclair A. et al. | 2014
- 178
-
Diameters of Cayley graphs generated by transposition treesKraft, Benjamin et al. | 2014
- 189
-
AVD-total-colouring of complete equipartite graphsLuiz, Atílio G. / Campos, C.N. / de Mello, C.P. et al. | 2014
- 196
-
On the Kirchhoff index of graphs with diameter 2Palacios, José Luis et al. | 2014
- 202
-
On the inverse sum indeg indexSedlar, Jelena / Stevanović, Dragan / Vasilyev, Alexander et al. | 2014
- 213
-
On constructing complete permutation polynomials over finite fields of even characteristicWu, Baofeng / Lin, Dongdai et al. | 2014
- 223
-
Proximity, remoteness and minimum degreeDankelmann, Peter et al. | 2014
- 229
-
A note on total domination and 2-rainbow domination in graphsFuruya, Michitaka et al. | 2014
- 231
-
Characterization of split graphs with at most four distinct eigenvaluesGhorbani, Modjtaba / Azimi, Nasrin et al. | 2014
- 237
-
The computational complexity of the backbone coloring problem for planar graphs with connected backbonesJanczewski, Robert / Turowski, Krzysztof et al. | 2014
- 243
-
(3, 1)-Choosability of toroidal graphs with some forbidden short cyclesJing, Yubo / Wang, Yingqian et al. | 2014
- 248
-
Ordered biclique partitions and communication complexity problemsShigeta, Manami / Amano, Kazuyuki et al. | 2014
- 253
-
Quasi-Hamiltonian cycles in -strong multipartite tournamentsSurmacs, Michel et al. | 2014
- 258
-
Degree conditions for graphs to be maximally -restricted edge connected and super -restricted edge connectedWang, Shiying / Zhao, Nana et al. | 2014
- v
-
Contents| 2015