On the number of maximal bipartite subgraphs of a graph

Journal of Graph Theory

Volumn 48, Issue 2, 2005, Pages 127-132

  Byskov, Jesper Makholm ^a   Madsen, Bolette Ammitzbøll ^a   Skjernaa, Bjarke ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

Coloring; Coloring algorithms; Maximal bipartite subgraphs

Indexed keywords

ALGORITHMS; POLYNOMIALS; THEOREM PROVING;

BIPARTITE SUBGRAPHS; COLORING ALGORITHMS; MAXIMAL BIPARTITE SUBGRAPHS; UPPER BOUNDS;

GRAPH THEORY;

EID: 13444303999     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/jgt.20041     Document Type: Article

References (8)

1. J. M. Byskov, Algorithms for k-coloring and finding maximal independent sets, Proc 14th Symp Discrete Algorithms, ACM and SIAM, 2003, pp. 456-457.
2. D. Eppstein, Improved algorithsms for 3-coloring, 3-edge-coloring, and constraint satisfaction, Proc 12th Symp Discrete Algorithms, ACM and SIAM, 2001, pp. 329-337.
3. D. Eppstein, Small maximal independent sets and faster exact graph coloring, J Graph Algor Appl 7(2) (2003), 131-140. Special issue for WADS'01.
4. S. Fajtlowicz, Written on the wall, URL http://www.math.uh.edu/~siemion/.
5. S. Fajtlowicz and S. Skiena, A database of counterexample to conjectures by graffiti, URL ftp://ftp.cs.sunyab.edu/pub/combinatorica/graffiti/.
6. J. W. Moon and L. Moser, On cliques in graphs, Israel J Math 3 (1965), 23-28.
7. I. Schiermeyer, Fast exact colouring algorithms, Tatra Mount Math Pub 9 (1996), 15-30.
8. S. Tsukiyama, M. Ide, H. Ariyoshi, and I. Shirakawa, A new algorithm for generating all the maximal independent sets, SIAM J Comput 6(3) (1977), 505-517.