Pages that link to "Item:Q1894756"
From MaRDI portal
The following pages link to Vertex arboricity and maximum degree (Q1894756):
Displaying 19 items.
- On the vertex-arboricity of planar graphs without 7-cycles (Q442319) (← links)
- A unified proof of Brooks' theorem and Catlin's theorem (Q472980) (← links)
- Vertex arboricity of integer distance graph \(G(D_{m,k})\) (Q1024482) (← links)
- Maximum vertex and face degree of oblique graphs (Q1044926) (← links)
- Independent feedback vertex sets for graphs of bounded diameter (Q1685021) (← links)
- Partitioning a graph into degenerate subgraphs (Q2011133) (← links)
- A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs (Q2142650) (← links)
- Circular vertex arboricity (Q2275930) (← links)
- On the vertex arboricity of planar graphs of diameter two (Q2384426) (← links)
- On the vertex-arboricity of planar graphs (Q2427551) (← links)
- On the vertex-arboricity of \(K_5\)-minor-free graphs of diameter 2 (Q2436824) (← links)
- Tree coloring of distance graphs with a real interval set (Q2481438) (← links)
- Vertex arboricity of planar graphs without chordal 6-cycles (Q2868169) (← links)
- Vertex partition of hypergraphs and maximum degenerate subhypergraphs (Q4958039) (← links)
- Recognizing Graphs Close to Bipartite Graphs (Q5111287) (← links)
- Sparse Graphs Are Near-Bipartite (Q5130577) (← links)
- (Q5197598) (← links)
- Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration (Q6056774) (← links)
- Partitioning of a graph into induced subgraphs not containing prescribed cliques (Q6180565) (← links)
