default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArs Combinatoria, Volume 50
Volume 50, December 1998
- Johannes H. Hattingh, Michael A. Henning, Jacobus L. Walters:
Distance irredundance in graphs: complexity issues. Ars Comb. 50 (1998) - Denis Hanson, C. O. M. Loten, Bjarne Toft:
On interval colourings of bi-regular bipartite graphs. Ars Comb. 50 (1998) - Michele Mulazzani:
Stiff Genus of Groups. Ars Comb. 50 (1998) - Pranava K. Jha, Sandi Klavzar:
Independence in Direct-Product Graphs. Ars Comb. 50 (1998) - Dawn M. Jones, Denny James Roehm, Michelle Schultz:
On Matchings in Graphs. Ars Comb. 50 (1998) - Zhi-Hong Chen:
Fan-Type Conditions for Collapsible Graphs. Ars Comb. 50 (1998) - Suh-Ryung Kim, Fred S. Roberts:
The Elimination Procedure for the Competition Number. Ars Comb. 50 (1998) - Sho Ishizuka:
Closure, Path-Factors and Path Coverings in Claw-Free Graphs. Ars Comb. 50 (1998) - Alan C. H. Ling, Charles J. Colbourn:
Deleting Lines in Projective Planes. Ars Comb. 50 (1998) - Jin Ho Kwak, Jaeun Lee:
Isomorphism classes of bipartite cycle permutation graphs. Ars Comb. 50 (1998) - Iiro S. Honkala:
Combinatorial lower bounds on binary codes with covering radius one. Ars Comb. 50 (1998) - Zdzislaw Grodzki, Aleksander Wronski:
Generalized de Bruijn multigraphs of rank k. Ars Comb. 50 (1998) - Izak Broere, Jean E. Dunbar, Johannes H. Hattingh:
Minus k-subdomination in graphs. Ars Comb. 50 (1998) - Purwanto, W. D. Wallis:
Minimum Order of a Graph with Given Deficiency and Either Minimum or Maximum Degree. Ars Comb. 50 (1998) - Neville Robbins:
Some New Partition Identities. Ars Comb. 50 (1998) - Noboru Hamada:
The Nonexistence of Ternary [231, 6, 153] Codes. Ars Comb. 50 (1998) - Charles J. Colbourn, Jianxing Yin:
On Directed Incomplete Transversal Designs with Block Size Five. Ars Comb. 50 (1998) - Béla Bollobás, Paul Erdös:
Graphs of Extremal Weights. Ars Comb. 50 (1998) - Giorgio Faina, Stefano Marcugini, Alfredo Milani, Fernanda Pambianco:
The sizes k of the complete k-caps in PG(n, q), for small q and 3 <= n >= 5. Ars Comb. 50 (1998) - Kishore Sinha, Byron Jones, Sanpei Kageyama:
A Series of quasi-multiple BIB Designs from Hadamard Matrices. Ars Comb. 50 (1998) - Gaetano Quattrocchi:
Spanning Sets and Scattering Sets in Handcuffed Designs of order v and block size 3. Ars Comb. 50 (1998) - S. Louis Hakimi, John Mitchem, Edward F. Schmeichel:
Short Proofs of Theorems of Nash-Williams and Tutte. Ars Comb. 50 (1998) - C. Pandu Rangan, K. R. Parthasarathy, V. Prakash:
On The g-centroidal Problem in Special Classes of Perfect Graphs. Ars Comb. 50 (1998) - Mingchu Li:
On Pancyclic Claw-Free Graphs. Ars Comb. 50 (1998) - Gunnar Brinkmann, Eckhard Steffen:
Snarks and Reducibility. Ars Comb. 50 (1998) - Uri Blass, Simon Litsyn:
Several new lower bounds for football pool systems. Ars Comb. 50 (1998) - Thomas Hofmeister, Hanno Lefmann:
On k-Partite Subgraphs. Ars Comb. 50 (1998) - Hongquan Yu, Tianming Wang:
An Inequality on Connected Domination Parameters. Ars Comb. 50 (1998) - Olof Barr:
Properly Coloured Hamiltonian Paths in Edge-Coloured Complete Graphs without Monochromatic Triangles. Ars Comb. 50 (1998)
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-13 19:01 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:
