Pages that link to "Item:Q3845890"
From MaRDI portal
The following pages link to On circuits and subgraphs of chromatic graphs (Q3845890):
Displaying 12 items.
- Two results on the digraph chromatic number (Q418896) (← links)
- Coloring chip configurations on graphs and digraphs (Q763476) (← links)
- How to make a graph bipartite (Q805628) (← links)
- Local and global colorability of graphs (Q898084) (← links)
- Local edge colouring of Yao-like subgraphs of unit disk graphs (Q1008738) (← links)
- On the existence of two non-neighboring subgraphs in a graph (Q1078191) (← links)
- On cutting-plane proofs in combinatorial optimization (Q1123134) (← links)
- Chromatic number and girth (Q1220081) (← links)
- Comparing the strength of query types in property testing: the case of \(k\)-colorability (Q1947037) (← links)
- On the growth rate of chromatic numbers of finite subgraphs (Q2182268) (← links)
- Almost all graphs with 1.44n edges are 3-colorable (Q3201078) (← links)
- On chromatic number of graphs and set-systems (Q5530478) (← links)
