Premium
Maximum k ‐colorable subgraphs
Author(s) -
Locke S. C.
Publication year - 1982
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.3190060206
Subject(s) - combinatorics , mathematics , bipartite graph , complete bipartite graph , graph , upper and lower bounds , discrete mathematics , mathematical analysis
A lower bound is established on the number of edges in a maximum k ‐colorable subgraph of a loopless graph G . For the special case of 3‐regular graphs, lower bounds are also determined on the maximum number of edges in a bipartite subgraph whose color classes are of equal size.
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