Premium
Paths in bipartite graphs with color‐inverting involutions
Author(s) -
Sabidussi Gert
Publication year - 1989
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190130204
Subject(s) - bipartite graph , mathematics , combinatorics , involution (esoterism) , graph , discrete mathematics , politics , political science , law
We consider connected bipartite graphs that have a color‐inverting involution and do not contain an induced path of length 5. It is shown that such graphs have a color‐preserving involution or a dominating edge, or else contain one of two simple forbidden subgraphs.