A new characterization for parity graphs and a coloring problem with costs

  • Klaus Jansen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1380)


In this paper, we give a characterization for parity graphs. A graph is a parity graph, if and only if for every pair of vertices all minimal chains joining them have the same parity. We prove that G is a parity graph, if and only if the Cartesian product G×K 2 is a perfect graph.

Furthermore, as a consequence we get a result for the polyhedron corresponding to an integer linear program formulation of a coloring problem with costs. For the case that the costs k v,3 =k v,c for each color c ≥ 3 and vertex v ∃ V, we show that the polyhedron contains only integral 0/1 extrema if and only if the graph G is a parity graph.


Bipartite Graph Maximum Clique Coloring Problem Perfect Graph Integer Linear Program Formulation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    G.S. Adhar and S. Peng, Parallel algorithms for cographs and parity graphs with applications, Journal of Algorithms 11 (1990), 252–284.CrossRefMathSciNetGoogle Scholar
  2. 2.
    H.J. Bandelt and H.M. Mulder, Metric characterization of parity graphs, Discrete Mathematics 91 (1991), 221–230.CrossRefMathSciNetGoogle Scholar
  3. 3.
    M. Burlet and J.P. Uhry, Parity graphs, Annals of Discrete Mathematics 21 (1984), 253–277.MathSciNetGoogle Scholar
  4. 4.
    V. Chvátal, On certain polytopes associated with graphs, Journal Combinatorial Theory B-18 (1975), 138–154.zbMATHCrossRefGoogle Scholar
  5. 5.
    S. Cicerone and G. Di Stefano, On the equivalence in complexity among basic problems on bipartite graphs and parity graphs, to appear in: International Symposium on Algorithms and Computation ISAAC 97, Singapore, LNCS (1997).Google Scholar
  6. 6.
    D. de Werra and A. Hertz, On perfectness of sums of graphs, Technical Report ORWP 87-13 and 97-06, Dept. de Mathématiques, Ecole Polytechnique Fédérale de Lausanne.Google Scholar
  7. 7.
    M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completness, Freeman, San Francisco, 1979.Google Scholar
  8. 8.
    M. Grötschel, L. Lovász and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer, Berlin, 1988.Google Scholar
  9. 9.
    K. Jansen, The optimum cost chromatic partition problem, Algorithms and Complexity CIAC 97, Rome, LNCS 1203 (1997), 25–36.MathSciNetGoogle Scholar
  10. 10.
    L.G. Kroon, A. Sen, H. Deng and A. Roy, The optimal cost chromatic partition problem for trees and interval graphs, Graph Theoretical Concepts in Computer Science WG 96, Como, LNCS (1996).Google Scholar
  11. 11.
    H. Meyniel, The graphs whose odd cycles have at least two crossing chords, Annals of Discrete Mathematics 21 (1984), 115–119.zbMATHMathSciNetGoogle Scholar
  12. 12.
    T. Przytycka and D.G. Corneil, Parallel algorithms for parity graphs, Journal of Algorithms 12 (1991), 96–109.CrossRefMathSciNetGoogle Scholar
  13. 13.
    G. Ravindra and K.R. Parathasarathy, Perfect product graphs, Discrete Mathematics, 20 (1977), 177–186.CrossRefMathSciNetGoogle Scholar
  14. 14.
    B. Reed, private communication.Google Scholar
  15. 15.
    H. Sachs, On the Berge conjecture concerning perfect graphs, in: Combinatorial Structures and their Applications, Gordon and Beach, New York, 1970, 377–384.Google Scholar
  16. 16.
    A. Sen, H. Deng and S. Guha, On a graph partition problem with an application to VLSI layout, Information Processing Letters 43 (1992), 87–94.CrossRefMathSciNetGoogle Scholar
  17. 17.
    K.J. Supowit, Finding a maximum planar subset of a set of nets in a channel, IEEE Transactions on Computer Aided Design, CAD 6, 1 (1987) 93–94.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Klaus Jansen
    • 1
  1. 1.Im StadtwaldMax-Planck Institut für InformatikSaarbrückenGermany

Personalised recommendations