Log in

Relevant bibliographies by topics / Graph problems / Books

Books on the topic 'Graph problems'

To see the other types of publications on this topic, follow the link: Graph problems.

Author: Grafiati

Published: 4 June 2021

Last updated: 30 January 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 books for your research on the topic 'Graph problems.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse books on a wide variety of disciplines and organise your bibliography correctly.

1

Jensen, Tommy R. Graph coloring problems. New York: Wiley, 1995.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Jensen, Tommy R. Graph coloring problems. New York: Wiley, 1995.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Jensen, Tommy R., and Bjarne Toft. Graph Coloring Problems. Hoboken, NJ, USA: John Wiley & Sons, Inc., 1994. http://dx.doi.org/10.1002/9781118032497.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Goldengorin, Boris, ed. Optimization Problems in Graph Theory. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-94830-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Bylka, Stanisław. Reconstruction problems for hypergraphs. Warszawa: Institute of Computer Science, [Polish Academy of Science, 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Problems in combinatorics and graph theory. New York: Wiley, 1985.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

1949-, Miller Mirka, ed. Super edge-antimagic graphs: A wealth of problems and some solutions. Boca Raton, Fla: BrownWalker Press, 2008.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

1913-, Erdős Paul, and Graham Ronald L. 1935-, eds. Erdős on graphs: His legacy of unsolved problems. Wellesley, Mass: AK Peters, 1998.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Vasudev, C. Graph theory with applications. New Delhi: New Age International (P) Ltd., Publishers, 2006.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

V, Melʹnikov O., ed. Exercises in graph theory. Dordrecht: Kluwer Academic Publishers, 1998.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

11

Fournier, Jean-Claude. Graph theory and applications with exercises and problems. Hoboken, NJ: Wiley, 2009.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

12

America, Mathematical Association of, ed. Graph theory: A problem oriented approach. Washington, D.C: Mathematical Association of America, 2008.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

13

Karpiński, Marek. Fast parallel algorithms for graph matching problems. Oxford: Clarendon Press, 1998.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

14

Brualdi, Richard A., Shmuel Friedland, and Victor Klee, eds. Combinatorial and Graph-Theoretical Problems in Linear Algebra. New York, NY: Springer New York, 1993. http://dx.doi.org/10.1007/978-1-4613-8354-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Scheffler, Petra. Linear-time algorithms for NP-complete problems restricted to partial k-trees. Berlin: Akademie der Wissenschaften der DDR, Karl-Weierstrass-Institut für Mathematik, 1987.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

16

Graphing story problems. Ann Arbor, Mich: Cherry Lake Pub., 2013.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

17

Schaum's outline of theory and problems of graph theory. New York: McGraw-Hill, 1997.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

18

Circuit double cover of graphs. Cambridge: Cambridge University Press, 2012.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

19

Extremal graph theory with emphasis on probabilistic methods. Providence, R.I: Published for the Conference Board of the Mathematical Sciences by the American Mathematical Society, 1986.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

20

Matrices and graphs: Stability problems in mathematical ecology. Boca Raton: CRC Press, 1993.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

21

Ning, Xuanxi. The blocking flow theory and its application to Hamiltonian graph problems. Aachen: Shaker Verlag, 2006.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

22

Large networks and graph limits. Providence, Rhode Island: American Mathematical Society, 2012.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

23

Indian Institute of Management, Ahmedabad., ed. Solving medium to large sized euclidean generalized minimum spanning tree problems. Ahmedabad: Indian Institute of Management, 2003.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

24

Sen, Anup K. Graph search methods for non-order-preserving evaluation functions: Applications to job sequencing problems. Calcutta: Indian Institute of Management, 1995.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

25

El-Darzi, Elia. Methods for solving the set covering and set partitioning problems using graph theoretic (relaxation) algorithms. Uxbridge: Brunel University, 1988.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

26

Barthélemy, Jean-Pierre. Trees and proximity representations. Chichester: Wiley, 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

27

Extremal paths in graphs: Foundations, search strategies, and related topics. Berlin: Akademie Verlag, 1997.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

28

Vanderhoof, Catherine, ed. Math Tests: No Problem! Application. New York, USA 1994: Scholastic Inc., 1994.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

29

Köbler, Johannes, Uwe Schöning, and Jacobo Torán. The Graph Isomorphism Problem. Boston, MA: Birkhäuser Boston, 1993. http://dx.doi.org/10.1007/978-1-4612-0333-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Voss, Stefan. Steiner-Probleme in Graphen. Frankfurt am Main: Anton Hain, 1990.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

31

Aigner, Martin. Graph theory: A development from the 4-color problem. Moscow, Idaho, USA: BCS Associates, 1987.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

32

R, Johnson Charles, and Loewy Raphael 1943-, eds. The real positive definite completion problem: Cycle completability. Providence, R.I: American Mathematical Society, 1996.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

33

Gyárfás, A. Problems from the world surrounding perfect graphs. Budapest: Computer and Automation Institute, Hungarian Academy of Sciences, 1985.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

34

Roy, Nelson, and Wilson Robin J, eds. Graph colourings. Essex, England: Longman Scientific & Technical, 1990.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

35

Cozzens, Margaret B. Problem solving using graphs. Arlington, Mass: COMAP (Consortium for Mathematics and Its Applications), 1987.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

36

The linear ordering problem: Algorithms and applications. Berlin: Heldermann, 1985.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

37

Indian Institute of Management, Ahemdabad., ed. A probabilistic tabu search algorithm for the generalized minimum spanning tree problem. Ahmedabad: Indian Institute of Management, 2003.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

38

Jensen, Tommy R., and Bjarne Toft. Graph Coloring Problems. Wiley & Sons, Incorporated, John, 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

39

Jensen, Tommy R., and Bjarne Toft. Graph Coloring Problems. Wiley & Sons, Incorporated, John, 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

40

Hajnal, Peter. Complexity of graph problems. 1988.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

41

Smith, Cynthia O. Math Word Problems and Graph. Createspace Independent Publishing Platform, 2016.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

42

Vishwanathan, Sundar. Online algorithms for graph problems. 1993.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

43

Wu, Bang Ye, and Kun-Mao Chao. Spanning Trees and Optimization Problems. Taylor & Francis Group, 2004.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

44

Wu, Bang Ye, and Kun-Mao Chao. Spanning Trees and Optimization Problems. Taylor & Francis Group, 2004.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

45

Wu, Bang Ye, and Kun-Mao Chao. Spanning Trees and Optimization Problems. Taylor & Francis Group, 2004.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

46

Wu, Bang Ye, and Kun-Mao Chao. Spanning Trees and Optimization Problems. Taylor & Francis Group, 2004.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

47

Wu, Bang Ye, and Kun-Mao Chao. Spanning Trees and Optimization Problems. Taylor & Francis Group, 2004.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

48

Graphs, Networks and Design (Course MT365). Open University Worldwide, 1995.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

49

Fournier, Jean-Claude. Graphs Theory and Applications: With Exercises and Problems. Wiley & Sons, Incorporated, John, 2013.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

50

Hedetniemi, Stephen, Ralucca Gera, and Craig Larson. Graph Theory: Favorite Conjectures and Open Problems - 1. Springer London, Limited, 2016.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!