Skip to main content
SpringerLink
Log in

The Black-and-White Coloring Problem on Distance-Hereditary Graphs and Strongly Chordal Graphs

  • Conference paper
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7285))

  • 763 Accesses

Abstract

Given a graph G and integers b and w. The black-and-white coloring problem asks if there exist disjoint sets of vertices B and W with |B|=b and |W|=w such that no vertex in B is adjacent to any vertex in W. In this paper we show that the problem is polynomial when restricted to cographs, distance-hereditary graphs, interval graphs and strongly chordal graphs. We show that the problem is NP-complete on splitgraphs.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Acharya, B., Las Vergnas, M.: Hypergraphs with cyclomatic number zero, triangulated graphs, and an inequality. Journal of Combinatorial Theory, Series B 33, 52–56 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  2. Anstee, R.: Hypergraphs with no special cycles. Combinatorica 3, 141–146 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  3. Anstee, R., Farber, M.: Characterizations of totally balanced matrices. Journal of Algorithms 5, 215–230 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bandelt, H., Mulder, H.: Distance-hereditary graphs. Journal of Combinatorial Theory, Series B 41, 182–208 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  5. Beineke, L., Pippert, R.: The number of labeled k-dimensional trees. Journal of Combinatorial Theory 6, 200–205 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  6. Berend, D., Zucker, S.: The black-and-white coloring problem on trees. Journal of Graph Algorithms and Applications 13, 133–152 (2009)

    MathSciNet  MATH  Google Scholar 

  7. Booth, K., Lueker, G.: Linear algorithms to recognize interval graphs and test for the consecutive ones property. In: Proceedings STOC 1975, pp. 255–265. ACM (1975)

    Google Scholar 

  8. Broersma, H., Kloks, T., Kratsch, D., Müller, H.: Independent sets in asteroidal triple-free graphs. SIAM Journal on Discrete Mathematics 12, 276–287 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  9. Brouwer, A., Duchet, P., Schrijver, A.: Graphs whose neighborhoods have no special cycle. Discrete Mathematics 47, 177–182 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  10. Brouwer, A., Kolen, A.: A super-balanced hypergraph has a nest point. Technical Report ZW 146, Mathematisch Centrum, Amsterdam (1980)

    Google Scholar 

  11. Chang, M., Hsieh, S., Chen, G.: Dynamic Programming on Distance-Hereditary Graphs. In: Leong, H.-V., Jain, S., Imai, H. (eds.) ISAAC 1997. LNCS, vol. 1350, pp. 344–353. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  12. Chvátal, V., Hammer, P.: Aggregation of inequalities in integer programming. Technical Report STAN-CS-75-518, Stanford University, California (1975)

    Google Scholar 

  13. Corneil, D., Lerchs, H., Stewart-Burlingham, L.: Complement reducible graphs. Discrete Applied Mathematics 3, 163–174 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  14. Corneil, D., Perl, Y., Stewart, L.: A linear recognition algorithm for cographs. SIAM Journal on Computing 14, 926–934 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  15. Dirac, G.: On rigid circuit graphs. Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg 25, 71–76 (1961)

    Article  MathSciNet  MATH  Google Scholar 

  16. Farber, M.: Characterizations of strongly chordal graphs. Discrete Mathematics 43, 173–189 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  17. Földes, S., Hammer, P.: Split graphs. Congressus Numerantium 19, 311–315 (1977)

    Google Scholar 

  18. Gavril, F.: The intersection graphs of subtrees in trees are exactly the chordal graphs. Journal of Combinatorial Theory, Series B 16, 47–56 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  19. Gilmore, P., Hoffman, A.: A characterization of comparability graphs and of interval graphs. The Canadian Journal of Mathematics 16, 539–548 (1964)

    Article  MathSciNet  MATH  Google Scholar 

  20. Hajnal, A., Surányi, J.: Über die Auflösung von Graphen in vollständige Teilgraphen. Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae – Sectio Mathematicae 1, 113–121 (1958)

    MATH  Google Scholar 

  21. Hammer, P., Peled, U., Sun, X.: Difference graphs. Discrete Applied Mathematics 28, 35–44 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  22. Hansen, P., Hertz, A., Quinodos, N.: Splitting trees. Discrete Mathematics 165, 403–419 (1997)

    Article  MathSciNet  Google Scholar 

  23. Hoffman, A., Kolen, A., Sakarovitch, M.: Totally-balanced and greedy matrices. Technical Report BW 165/82, Mathematisch Centrum, Amsterdam (1982)

    Google Scholar 

  24. Howorka, E.: A characterization of distance-hereditary graphs. The Quarterly Journal of Mathematics 28, 417–420 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  25. Johnson, D.: The NP-completeness column: An ongoing guide. Journal of Algorithms 8, 438–448 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  26. Kloks, T.: Treewidth – Computations and Approximations. LNCS, vol. 842. Springer, Heidelberg (1994)

    Google Scholar 

  27. Kloks, T., Poon, S., Tsai, F., Wang, Y.: The black-and-white coloring problem on distance-hereditary graphs and strongly chordal graphs. Manuscript on ArXiv: 1111.0867v1 (2011)

    Google Scholar 

  28. Lehel, J.: A characterization of totally balanced hypergraphs. Discrete Mathematics 57, 59–65 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  29. Lekkerkerker, C., Boland, D.: Representation of finite graphs by a set of intervals on the real line. Fundamenta Mathematicae 51, 45–64 (1962)

    MathSciNet  MATH  Google Scholar 

  30. Mahadev, N., Peled, U.: Threshold graphs and related topics. Elsevier Series Annals of Discrete Mathematics 56 (1995)

    Google Scholar 

  31. Moon, J.: The number of labeled k-trees. Journal of Combinatorial Theory 6, 196–199 (1969)

    Article  MATH  Google Scholar 

  32. Rose, D.: Triangulated graphs and the elimination process. Journal of Mathematical Analysis and Applications 32, 597–609 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  33. Rose, D.: On simple characterizations of k-trees. Discrete Mathematics 7, 317–322 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  34. Yannakakis, M.: The complexity of the partial order dimension problem. SIAM Journal on Algebraic and Discrete Methods 3, 351–358 (1982)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, National Tsing Hua University, No. 101, Sec. 2, Kuang Fu Rd., Hsinchu, Taiwan

    Ton Kloks & Sheung-Hung Poon

  2. Institute of Information Systems and Applications, National Tsing Hua University, No. 101, Sec. 2, Kuang Fu Rd., Hsinchu, Taiwan

    Feng-Ren Tsai

  3. Department of Information Management, National Taiwan University of Science and Technology, No. 43, Sec. 4, Keelung Rd., Taipei, 106, Taiwan

    Yue-Li Wang

Authors
  1. Ton Kloks
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sheung-Hung Poon
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Feng-Ren Tsai
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yue-Li Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of North Carolina, CB 3175 Brooks Bldg, 27599-3175, Chapel Hill, NC, USA

    Jack Snoeyink

  2. Microsoft Research Asia, No 999, Zixing Road, Minhang District, 200241, Shanghai, China

    Pinyan Lu

  3. Peking University, Science BLK 1, No.5 Yiheyuan Road, Haidian District, 100871, Beijing, P.R.China

    Kaile Su

  4. Department of Computer Science, City University of Hong Kong, Tat Chee Ave., Kowloon, Hong Kong

    Lusheng Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kloks, T., Poon, SH., Tsai, FR., Wang, YL. (2012). The Black-and-White Coloring Problem on Distance-Hereditary Graphs and Strongly Chordal Graphs. In: Snoeyink, J., Lu, P., Su, K., Wang, L. (eds) Frontiers in Algorithmics and Algorithmic Aspects in Information and Management. Lecture Notes in Computer Science, vol 7285. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29700-7_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29700-7_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29699-4

  • Online ISBN: 978-3-642-29700-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation