Skip to main navigation
Skip to search
Skip to main content
Illinois Experts Home
LOGIN & Help
Link opens in a new tab
Search content at Illinois Experts
Home
Profiles
Research units
Research & Scholarship
Datasets
Honors
Press/Media
Activities
The minimum number of edges in a 4-critical graph that is bipartite plus 3 edges
A. V. Kostochka
, B. M. Reiniger
Mathematics
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'The minimum number of edges in a 4-critical graph that is bipartite plus 3 edges'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Minimum number
100%
Number of Edges
100%
4-critical Graph
100%
3-graphs
100%
Erdos
25%
Bipartite Graph
25%
Critical Graph
25%
Mathematics
Edge
100%
Critical Graph
100%
Bipartite Graph
16%
Computer Science
Critical Graph
100%
Bipartite Graph
33%