The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
2007, volume: 307, number: 11-12

  1. Rafal Kalinowski, Mariusz Meszka
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1221-1222 [Journal]
  2. Mieczyslaw Borowiecki, Elzbieta Sidorowicz
    Generalised game colouring of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1225-1231 [Journal]
  3. Martin Baca, Yuqing Lin, Mirka Miller, Maged Z. Youssef
    Edge-antimagic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1232-1244 [Journal]
  4. Halina Bielak
    Chromatic properties of hamiltonian graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1245-1254 [Journal]
  5. Camino Balbuena, Xavier Marcote
    Lower connectivities of regular graphs with small diameter. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1255-1265 [Journal]
  6. Frank Bullock, Marietjie Frick, Joy Singleton
    Smallest claw-free, 2-connected, nontraceable graphs and the construction of maximal nontraceable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1266-1275 [Journal]
  7. Martín Cera, Ana Diánez, Pedro García-Vázquez, Juan Carlos Valenzuela
    Graphs without minor complete subgraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1276-1284 [Journal]
  8. Jean E. Dunbar, Marietjie Frick
    The Path Partition Conjecture is true for claw-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1285-1290 [Journal]
  9. Hao Li, Evelyne Flandrin, Jinlong Shu
    A sufficient condition for cyclability in directed graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1291-1297 [Journal]
  10. Ewa Drgas-Burchardt, Anna Fiedorowicz
    Cost colourings of hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1298-1305 [Journal]
  11. Domingos Moreira Cardoso, Paula Rama
    Spectral results on regular graphs with (k, tau)-regular sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1306-1316 [Journal]
  12. Dalibor Froncek
    Bi-cyclic decompositions of complete graphs into spanning trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1317-1322 [Journal]
  13. Alastair Farrugia
    Dually vertex-oblique graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1323-1331 [Journal]
  14. Agnieszka Görlich, Monika Pilsniak, Mariusz Wozniak, Irmina A. Ziolo
    Fixed-point-free embeddings of digraphs with small size. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1332-1340 [Journal]
  15. Jaroslaw Grytczuk
    Pattern avoidance on graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1341-1346 [Journal]
  16. Erik Bruoth, Mirko Hornák
    A lower bound for on-line ranking number of a path. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1347-1355 [Journal]
  17. Michael A. Henning
    Restricted domination in graphs with minimum degree 2. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1356-1366 [Journal]
  18. Joanna Górska, Zdzislaw Skupien
    Trees with maximum number of maximal matchings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1367-1377 [Journal]
  19. Martin Baca, Stanislav Jendrol, Mirka Miller, Joseph F. Ryan
    On irregular total labellings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1378-1388 [Journal]
  20. Bostjan Bresar, Sandi Klavzar
    Maximal proper subgraphs of median graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1389-1394 [Journal]
  21. Marián Klesc, Anna Kocúrová
    The crossing numbers of products of 5-vertex graphs with cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1395-1403 [Journal]
  22. Mikio Kano, Gyula Y. Katona
    Structure theorem and algorithm on (1, f)-odd subgraph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1404-1417 [Journal]
  23. Mieczyslaw Borowiecki, Ewa Lazuka
    On chromaticity of hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1418-1429 [Journal]
  24. Tomás Madaras, Riste Skrekovski, Heinz-Jürgen Voss
    The 7-cycle C7 is light in the family of planar graphs with minimum degree 5. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1430-1435 [Journal]
  25. Zhiquan Hu, Hao Li
    Partition of a graph into cycles and vertices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1436-1440 [Journal]
  26. Xavier Marcote, Camino Balbuena, Ignacio M. Pelayo
    On the connectivity of cages with girth five, six and eight. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1441-1446 [Journal]
  27. Adam Nadolski
    The circular chromatic index of some class 2 graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1447-1454 [Journal]
  28. Oleg Pikhurko
    Trees are almost prime. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1455-1462 [Journal]
  29. Evelyne Flandrin, Hao Li, Antoni Marczyk, Mariusz Wozniak
    A Chvátal-Erdos type condition for pancyclability. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1463-1466 [Journal]
  30. Michael A. Henning, Dieter Rautenbach
    On the irregularity of bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1467-1472 [Journal]
  31. Stefan Porschen
    On generalizations of the shadow independent set problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1473-1485 [Journal]
  32. Elzbieta Sidorowicz
    Size of weakly saturated graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1486-1492 [Journal]
  33. Yoshimi Egawa, Hikoe Enomoto, Stanislav Jendrol, Katsuhiro Ota, Ingo Schiermeyer
    Independence number and vertex-disjoint cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1493-1498 [Journal]
  34. Günter Schaar, Zdzislaw Skupien
    Pairs of trees in tree-tree triangulations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1499-1505 [Journal]
  35. D. Van Dyck, Veerle Fack
    On the reduction of Yutsis graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1506-1515 [Journal]
  36. Jean-Luc Fouquet, Jean-Marie Vanherpe
    On bipartite graphs with weak density of some subgraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1516-1524 [Journal]
  37. Denise Amar, Evelyne Flandrin, Grzegorz Gancarzewicz, A. Pawel Wojda
    Bipartite graphs with every matching in a cycle. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1525-1537 [Journal]
  38. Jens Schreyer, Hansjoachim Walther, Leonid S. Melnikov
    Vertex-oblique graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1538-1544 [Journal]
  39. Rafal Kalinowski, Mariusz Meszka
    Research Problems from the Fourth Cracow Conference (Czorsztyn, 2002). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1545-1549 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002