Premium
On 3‐colorings of bipartite p ‐threshold graphs
Author(s) -
Tomescu Ioan
Publication year - 1987
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.3190110307
Subject(s) - bipartite graph , combinatorics , mathematics , arithmetic function , complete bipartite graph , discrete mathematics , triangle free graph , class (philosophy) , strong perfect graph theorem , maximization , chordal graph , 1 planar graph , graph , computer science , mathematical optimization , artificial intelligence
In this paper some extremal properties of 3‐colorings of bipartite complete graphs in the class of all bipartite p‐threshold graphs that are uniquely 2‐colorable are proved. As a consequence it is shown that the complete bipartite graphs K p, p + r where p ⩾ 2 and 0 ⩽ r
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom