12. Problems with Comments

  1. Jean-Claude Fournier

Published Online: 2 FEB 2010

DOI: 10.1002/9780470611548.ch12

Graph Theory and Applications: With Exercises and Problems

Graph Theory and Applications: With Exercises and Problems

How to Cite

Fournier, J.-C. (2009) Problems with Comments, in Graph Theory and Applications: With Exercises and Problems, ISTE, London, UK. doi: 10.1002/9780470611548.ch12

Publication History

  1. Published Online: 2 FEB 2010
  2. Published Print: 1 JAN 2009

ISBN Information

Print ISBN: 9781848210707

Online ISBN: 9780470611548

SEARCH

Keywords:

  • communication networks;
  • strict digraph;
  • spanning subdigraph;
  • algorithm;
  • subdigraph

Summary

This chapter contains sections titled:

  • Problem 1: A proof of k-connectivity

  • Problem 2: An application to compiler theory

  • Problem 3: Kernel of a digraph

  • Problem 4: Perfect matching in a regular bipartite graph

  • Problem 5: Birkhoff-Von Neumann's theorem

  • Problem 6: Matchings and tilings

  • Problem 7: Strip mining