Pages that link to "Item:Q626759"
From MaRDI portal
The following pages link to Upper bounds on the linear chromatic number of a graph (Q626759):
Displaying 16 items.
- Linear coloring of planar graphs without 4-cycles (Q354457) (← links)
- On linear coloring of planar graphs with small girth (Q400495) (← links)
- A result on linear coloring of planar graphs (Q456164) (← links)
- Some properties of chromatic coefficients of linear uniform hypergraphs (Q844223) (← links)
- The chromatic number of graphs which induce neither \(K_{1,3}\) nor \(K_ 5-e\) (Q1078192) (← links)
- The \(k\)th upper chromatic number of the line (Q1357732) (← links)
- Linear coloring of graphs (Q1584255) (← links)
- New upper bounds on linear coloring of planar graphs (Q1757984) (← links)
- On bounding the chromatic number of L-graphs (Q1918550) (← links)
- Linear list coloring of some sparse graphs (Q2214305) (← links)
- Linear colorings of subcubic graphs (Q2444734) (← links)
- An upper bound of linear chromatic number of planar graphs (Q2916456) (← links)
- Linear degree extractors and the inapproximability of max clique and chromatic number (Q2931428) (← links)
- Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graphs (Q3449868) (← links)
- (Q3984938) (← links)
- (Q4943530) (← links)