Skip to main navigation
Skip to search
Skip to main content
Ariel University Home
Help & FAQ
!!Link opens in a new tab
English
עברית
العربية
!!Search content at Ariel University
Home
Profiles
Research units
Equipment
Research output
Prizes
Activities
Press/Media
On colorability of graphs with forbidden minors along paths and circuits
Elad Horev
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'On colorability of graphs with forbidden minors along paths and circuits'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Colorability
100%
Forbidden Minor
100%
Simple Paths
100%
Minor-free Graphs
50%
Chromatic number
25%
Tight
25%
Planar Graph
25%
Forbidden Configurations
25%
Mathematics
Free Graph
100%
Induced Subgraph
100%
Colorability
100%
Edge
50%
Chromatic Number
50%
Planar Graph
50%