The following pages link to (Q4873220):
Displaying 15 items.
- On weight choosabilities of graphs with bounded maximum average degree (Q516900) (← links)
- Homomorphisms from sparse graphs to the Petersen graph (Q709319) (← links)
- Decomposing a graph into forests (Q765188) (← links)
- On the neighbour sum distinguishing index of graphs with bounded maximum average degree (Q1696532) (← links)
- Partitioning sparse graphs into an independent set and a forest of bounded degree (Q1753010) (← links)
- A Brooks type theorem for the maximum local edge connectivity (Q1753016) (← links)
- \(L(p,q)\)-labeling of sparse graphs (Q1956243) (← links)
- Coloring squares of graphs with mad constraints (Q2009007) (← links)
- On the total neighbour sum distinguishing index of graphs with bounded maximum average degree (Q2292151) (← links)
- Incidence coloring of graphs with high maximum average degree (Q2357131) (← links)
- QUBO formulations of the longest path problem (Q2658047) (← links)
- Semialgebraic graphs having countable list-chromatic numbers (Q2790252) (← links)
- Vertex Partitions of Graphs into Cographs and Stars (Q2874091) (← links)
- Vizing's coloring algorithm and the fan number (Q3055930) (← links)
- Hypergraph list coloring and Euclidean Ramsey theory (Q3094608) (← links)
