Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("VAN DEN HEUVEL, Jan")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 82

  • Page / 4
Export

Selection :

  • and

Transversals of Subtree Hypergraphs and the Source Location Problem in DigraphsVAN DEN HEUVEL, Jan; JOHNSON, Matthew.Networks (New York, NY). 2008, Vol 51, Num 2, pp 113-119, issn 0028-3045, 7 p.Article

ON THE COMPLEXITY OF ORDERED COLORINGSGUPTA, Arvind; VAN DEN HEUVEL, Jan; MANUCH, Jan et al.SIAM journal on discrete mathematics (Print). 2009, Vol 22, Num 2, pp 832-847, issn 0895-4801, 16 p.Article

Selected Papers from the 22nd British Combinatorial ConferenceEDWARDS, Keith; VAN DEN HEUVEL, Jan; PERKINS, Stephanie et al.Discrete mathematics. 2011, Vol 311, Num 13, issn 0012-365X, 185 p.Conference Proceedings

The external network problem with edge- or arc-connectivity requirementsVAN DEN HEUVEL, Jan; JOHNSON, Matthew.Lecture notes in computer science. 2005, pp 114-126, issn 0302-9743, isbn 3-540-27873-7, 13 p.Conference Paper

Connectedness of the graph of vertex-colouringsCERECEDA, Luis; VAN DEN HEUVEL, Jan; JOHNSON, Matthew et al.Discrete mathematics. 2008, Vol 308, Num 5-6, pp 913-919, issn 0012-365X, 7 p.Conference Paper

A simple proof of an inequality connecting the alternating number of independent sets and the decycling numberLEVIT, Vadim E; MANDRESCU, Eugen.Discrete mathematics. 2011, Vol 311, Num 13, pp 1204-1206, issn 0012-365X, 3 p.Conference Paper

Gallai―Ramsey numbers for cyclesFUJITA, Shinya; MAGNANT, Colton.Discrete mathematics. 2011, Vol 311, Num 13, pp 1247-1254, issn 0012-365X, 8 p.Conference Paper

Spreads, arcs, and multiple wavelength codesALDERSON, T. L; MELLINGER, Kith E.Discrete mathematics. 2011, Vol 311, Num 13, pp 1187-1196, issn 0012-365X, 10 p.Conference Paper

The average degree of an edge-chromatic critical graphWOODALL, Douglas R.Discrete mathematics. 2008, Vol 308, Num 5-6, pp 803-819, issn 0012-365X, 17 p.Conference Paper

On generalised t-designs and their parametersSOICHER, Leonard H.Discrete mathematics. 2011, Vol 311, Num 13, pp 1136-1141, issn 0012-365X, 6 p.Conference Paper

Cycles in a tournament with pairwise zero, one or two given vertices in commonLICHIARDOPOL, Nicolas.Discrete mathematics. 2008, Vol 308, Num 5-6, pp 763-771, issn 0012-365X, 9 p.Conference Paper

On reconstruction of signed permutations distorted by reversal errorsKONSTANTINOVA, Elena.Discrete mathematics. 2008, Vol 308, Num 5-6, pp 974-984, issn 0012-365X, 11 p.Conference Paper

Strength two covering arrays : Existence tables and projectionCOLBOURN, Charles J.Discrete mathematics. 2008, Vol 308, Num 5-6, pp 772-786, issn 0012-365X, 15 p.Conference Paper

Some structural properties of minimally contraction-critically 5-connected graphsANDO, Kiyoshi; QIN CHENGFU.Discrete mathematics. 2011, Vol 311, Num 13, pp 1084-1097, issn 0012-365X, 14 p.Conference Paper

Selected papers from 20th British Combinatorial ConferenceEDWARDS, Keith; BELL, Francis; GRIGGS, Terry et al.Discrete mathematics. 2008, Vol 308, Num 5-6, issn 0012-365X, 384 p.Conference Proceedings

Bipartite almost distance-hereditary graphsAÏDER, Méziane.Discrete mathematics. 2008, Vol 308, Num 5-6, pp 865-871, issn 0012-365X, 7 p.Conference Paper

On 2-factorizations whose automorphism group acts doubly transitively on the factorsMAZZUOCCOLO, Giuseppe.Discrete mathematics. 2008, Vol 308, Num 5-6, pp 931-939, issn 0012-365X, 9 p.Conference Paper

Rook polynomials on two-dimensional surfaces and graceful labellings of graphsWHITTY, Robin W.Discrete mathematics. 2008, Vol 308, Num 5-6, pp 674-683, issn 0012-365X, 10 p.Conference Paper

Kernels by monochromatic paths in digraphs with covering number 2GALEANA-SANCHEZ, Hortensia; OLSEN, Mika.Discrete mathematics. 2011, Vol 311, Num 13, pp 1111-1118, issn 0012-365X, 8 p.Conference Paper

Every SOMA(n - 2, n) is TrojanARHIN, John.Discrete mathematics. 2010, Vol 310, Num 2, pp 303-311, issn 0012-365X, 9 p.Conference Paper

On edge star sets in treesAKBARI, S; GHORBANI, E; MAHMOODI, A et al.Discrete mathematics. 2011, Vol 311, Num 13, pp 1172-1178, issn 0012-365X, 7 p.Conference Paper

Brick partitions of graphsJACKSON, Bill; JORDAN, Tibor.Discrete mathematics. 2010, Vol 310, Num 2, pp 270-275, issn 0012-365X, 6 p.Conference Paper

Cycle-regular graphs of (0, λ)-graph typeKAHOUL, Nawel; BERRACHEDI, Abdelhafid.Discrete mathematics. 2010, Vol 310, Num 2, pp 255-259, issn 0012-365X, 5 p.Conference Paper

Degree-bounded factorizations of bipartite multigraphs and of pseudographsHILTON, A. J. W.Discrete mathematics. 2010, Vol 310, Num 2, pp 288-302, issn 0012-365X, 15 p.Conference Paper

Research Problems from the BCC21CAMERON, Peter J.Discrete mathematics. 2010, Vol 310, Num 2, pp 347-354, issn 0012-365X, 8 p.Conference Paper

  • Page / 4