Pages that link to "Item:Q1969797"
From MaRDI portal
The following pages link to Triangle-free graphs with large chromatic numbers (Q1969797):
Displaying 40 items.
- Triangle-free intersection graphs of line segments with large chromatic number (Q401487) (← links)
- On degree sums of a triangle-free graph (Q465274) (← links)
- A note on generalized pentagons (Q709327) (← links)
- The chromatic gap and its extremes (Q713979) (← links)
- On the chromatic index of multigraphs without large triangles (Q794661) (← links)
- Degree sequences in triangle-free graphs (Q1182926) (← links)
- On the chromatic number of triangle-free graphs of large minimum degree (Q1410410) (← links)
- Coloring triangle-free graphs with fixed size (Q1567684) (← links)
- Triangle-free graphs and forbidden subgraphs (Q1613361) (← links)
- A 4-colour problem for dense triangle-free graphs (Q1613467) (← links)
- On the chromatic index of join graphs and triangle-free graphs with large maximum degree (Q1752497) (← links)
- A triangle-free circle graph with chromatic number 5 (Q1917502) (← links)
- Triangle-free graphs with large independent domination number (Q1952508) (← links)
- Dense induced bipartite subgraphs in triangle-free graphs (Q2003768) (← links)
- Structure and colour in triangle-free graphs (Q2034076) (← links)
- Extremal triangle-free and odd-cycle-free colourings of uncountable graphs (Q2036604) (← links)
- A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number (Q2101164) (← links)
- On existentially complete triangle-free graphs (Q2182038) (← links)
- On some graph classes related to perfect graphs: a survey (Q2184662) (← links)
- Bipartite induced density in triangle-free graphs (Q2185224) (← links)
- Triangle-free graphs of tree-width \(t\) are \(\lceil (t+3)/2 \rceil\)-colorable (Q2403691) (← links)
- Circumference, chromatic number and online coloring (Q2439828) (← links)
- On the abstract chromatic number and its computability for finitely axiomatizable theories (Q2668017) (← links)
- Triangle-free graphs without forbidden subgraphs (Q2741324) (← links)
- The number of the maximal triangle-free graphs (Q2922865) (← links)
- Some Results on Chromatic Number as a Function of Triangle Count (Q3122312) (← links)
- A Construction of Graphs without Triangles having Pre-Assigned Order and Chromatic Number (Q3276326) (← links)
- Circular chromatic number of triangle free graphs with given maximum average degree, extended abstract (Q3439626) (← links)
- Local Clique Covering of Claw-Free Graphs (Q3466357) (← links)
- (Q4309125) (← links)
- (Q4359588) (← links)
- Triangle-Free Graphs with Large Degree (Q4372989) (← links)
- The $\chi$-Ramsey Problem for Triangle-Free Graphs (Q5074951) (← links)
- On minimal triangle‐free 6‐chromatic graphs (Q5110643) (← links)
- (Q5309532) (← links)
- On the maximal triangle-free edge-chromatic graphs in three colors (Q5548828) (← links)
- Triangle-free subgraphs with large fractional chromatic number (Q5886312) (← links)
- Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs (Q5900083) (← links)
- Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs (Q5900860) (← links)
- Counting colorings of triangle-free graphs (Q6038582) (← links)
