default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArs Combinatoria, Volume 76
Volume 76, July 2005
- Candido Ferreira Xavier de Mendonça Neto, Erico F. Xavier, Jorge Stolfi, Luérbio Faria, Celina M. H. de Figueiredo:
The non planar vertex deletion of Cn x Cm. Ars Comb. 76 (2005) - Jill R. Faudree, Ronald J. Gould:
A Note on Neighborhood Unions and Independent Cycles. Ars Comb. 76 (2005) - Michael D. Hirschhorn, James A. Sellers:
Further results for partitions into four squares of equal parity. Ars Comb. 76 (2005) - Jianliang Wu, Ping Wang, Anthony J. W. Hilton:
Two sufficient conditions for a graph to be type 1. Ars Comb. 76 (2005) - Thomas Bier, Peter Suresh Padmanabhan:
Some Formulas for Generalized Stirling Numbers. Ars Comb. 76 (2005) - Candida Nunes da Silva, Ricardo Dahab:
3-flow Conjecture and Matchings in Bipartite Graphs. Ars Comb. 76 (2005) - Andrea Vietri:
Chromatic number of regular walls. Ars Comb. 76 (2005) - Shannon L. Fitzpatrick, Gary MacGillivray:
Non 3-Choosable Bipartite Graphs and The Fano Plane. Ars Comb. 76 (2005) - David James Ashe, Christopher A. Rodger, Hung-Lin Fu:
All 2-Regular Leaves of Partial 6-cycle Systems. Ars Comb. 76 (2005) - A. K. Agarwal:
New Classes of Combinatorial Identities. Ars Comb. 76 (2005) - Matthew A. Ollis, Pablo Spiga:
Every abelian group of odd order has a narcissistic terrace. Ars Comb. 76 (2005) - Teresa W. Haynes, Michael A. Henning, Peter J. Slater:
Trees with Equal Domination and Paired-domination Numbers. Ars Comb. 76 (2005) - Hiroshi Era, Kenjiro Ogawa, Morimasa Tsuchiya:
Note on transformation of posets with the same semi bound graphs. Ars Comb. 76 (2005) - Emanuele Munarini:
Enumeration of order ideals of a garland. Ars Comb. 76 (2005) - Ewa M. Kubicka:
Polynomial Algorithm for Finding Chromatic Sum for Unicyclic and Outerplanar Graphs. Ars Comb. 76 (2005) - Matthew M. Cropper, Peter D. Johnson Jr.:
Problems on Hall t-chromaticity. Ars Comb. 76 (2005) - Zbigniew R. Bogdanowicz:
Hamiltonian Circuits in Sparse Circulant Digraphs. Ars Comb. 76 (2005) - Hikoe Enomoto, Jun Fujisawa, Katsuhiro Ota:
A sk type condition for heavy cycles in weighted graphs. Ars Comb. 76 (2005) - Tao-Ming Wang:
On line graphs which are weakly maximal clique irreducible. Ars Comb. 76 (2005) - Lane H. Clark:
Comment on "Properly Coloured Hamiltonian Paths in Edge-coloured Complete Graphs without Monochromatic Triangles". Ars Comb. 76 (2005) - Maged Z. Youssef:
Pseudograceful Labelings of Cycles. Ars Comb. 76 (2005) - Miranca Fischermann, Dieter Rautenbach, Lutz Volkmann:
Extremal Trees with Respect to Dominance Order. Ars Comb. 76 (2005) - Nasrin Soltankhah, Ebadollah S. Mahmoodian:
On defining numbers of k-chromatic k-regular graphs. Ars Comb. 76 (2005) - Arie Bialostocki, Rasheed Sabar:
On constrained 2-Partitions of monochromatic sets and generalizations in the sense of Erdos-Ginzburg-Ziv. Ars Comb. 76 (2005) - Arnold Knopfmacher, Neville Robbins:
with parts constrained by the leading summand. Ars Comb. 76 (2005) - G. Sethuraman, A. Elumalai:
Packing of any set of graphs into a graceful/harmonious/elegant graphs. Ars Comb. 76 (2005) - Ligong Wang, Xueliang Li, Cornelis Hoede:
Two Classes of Integral Regular Graphs. Ars Comb. 76 (2005) - Sergey Kitaev, Toufik Mansour:
On multi-avoidance of generalized patterns. Ars Comb. 76 (2005)
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-12-19 22:13 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:
