Pages that link to "Item:Q1245229"
From MaRDI portal
The following pages link to A bound on the chromatic number of a graph (Q1245229):
Displaying 25 items.
- The \(m\)-degenerate chromatic number of a digraph (Q267198) (← links)
- Coloring immersion-free graphs (Q326817) (← links)
- A minimum degree condition forcing complete graph immersion (Q397072) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- Some remarks on the odd Hadwiger's conjecture (Q950324) (← links)
- Note on coloring graphs without odd-\(K_k\)-minors (Q1026013) (← links)
- A note on the independence number of triangle-free graphs. II (Q1186139) (← links)
- Another bound on the chromatic number of a graph (Q1248527) (← links)
- Chromatic number, girth and maximal degree (Q1252865) (← links)
- A new upper bound on the chromatic number of graphs with no odd \(K_t\) minor (Q2151177) (← links)
- Clique immersion in graphs without a fixed bipartite graph (Q2171024) (← links)
- Distributed coloring algorithms for triangle-free graphs (Q2347810) (← links)
- Fractional coloring and the odd Hadwiger's conjecture (Q2472835) (← links)
- New upper bounds for the chromatic number of a graph (Q2707978) (← links)
- Coloring Sparse Hypergraphs (Q2813339) (← links)
- Constructing Graphs with No Immersion of Large Complete Graphs (Q2922213) (← links)
- A Weakening of the Odd Hadwiger's Conjecture (Q3608337) (← links)
- On Brooks' Theorem for Sparse Graphs (Q4852428) (← links)
- Destroying Noncomplete Regular Components in Graph Partitions (Q4908827) (← links)
- Approximation of Constraint Satisfaction via local search (Q5057457) (← links)
- Hadwiger's Conjecture for Graphs with Forbidden Holes (Q5348213) (← links)
- (Q5743487) (← links)
- A note on Reed's conjecture for triangle-free graphs (Q6080563) (← links)
- On triangle-free list assignments (Q6184549) (← links)
