The following pages link to (Q4763420):
Displayed 7 items.
- Dynamic coloring of graphs having no \(K_5\) minor (Q277625) (← links)
- Structure and recognition of graphs with no 6-wheel subdivision (Q1031873) (← links)
- Tight upper bound on the number of edges in a bipartite \(K_{3,3}\)-free or \(K_{5}\)-free graph with an application. (Q1853125) (← links)
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778) (← links)
- Efficient algorithms for acyclic colorings of graphs (Q1978502) (← links)
- On even circuit decompositions of eulerian graphs (Q4277987) (← links)
- Optimization and Recognition for K 5-minor Free Graphs in Linear Time (Q5458529) (← links)