scientific article; zbMATH DE number 3889564

From MaRDI portal
Publication:3222874





[For the entire collection see Zbl 0546.00006.] A parity graph is a graph in which for every pair of vertices (x,y), the lengths of the minimal x,y-paths all have the same parity. The authors characterize these graphs, and observe that they are all perfect graphs. They then discuss polynomial algorithms for recognizing parity graphs, and for determining the maximum stable set, minimum colouring, minimum covering by cliques and maximum clique of a parity graph.




Cited in
(47)








This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3222874)