Pages that link to "Item:Q4521553"
From MaRDI portal
The following pages link to The strong chromatic index ofC4-free graphs (Q4521553):
Displaying 38 items.
- Strong edge coloring sparse graphs (Q324370) (← links)
- A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem (Q336528) (← links)
- The strong chromatic index of Halin graphs (Q411659) (← links)
- Strong chromatic index of planar graphs with large girth (Q472129) (← links)
- Spectral bounds for the \(k\)-independence number of a graph (Q501229) (← links)
- On \((s,t)\)-relaxed strong edge-coloring of graphs (Q511712) (← links)
- A note on the strong edge-coloring of outerplanar graphs with maximum degree 3 (Q519218) (← links)
- Fractional strong chromatic index of bipartite graphs (Q526231) (← links)
- Strong edge colouring of subcubic graphs (Q642999) (← links)
- Maximum induced matching of hexagonal graphs (Q726519) (← links)
- Strong chromatic index of \(K_{1, t}\)-free graphs (Q777360) (← links)
- On the complexity of bandwidth allocation in radio networks (Q952444) (← links)
- The strong chromatic index of complete cubic Halin graphs (Q1021818) (← links)
- On the computational complexity of strong edge coloring (Q1602692) (← links)
- On the precise value of the strong chromatic index of a planar graph with a large girth (Q1671365) (← links)
- Distance colouring without one cycle length (Q1689995) (← links)
- On the approximability of the maximum induced matching problem (Q1775017) (← links)
- Injective edge-coloring of graphs with given maximum degree (Q2033899) (← links)
- Strong cliques in claw-free graphs (Q2053719) (← links)
- Optimization of eigenvalue bounds for the independence and chromatic number of graph powers (Q2065879) (← links)
- Strong edge coloring of circle graphs (Q2122690) (← links)
- A new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence number (Q2197265) (← links)
- Strong cliques and forbidden cycles (Q2288223) (← links)
- On the \(k\)-independence number of graphs (Q2317661) (← links)
- On a topological relaxation of a conjecture of Erdős and Nešetřil (Q2349967) (← links)
- On the connectivity of diamond-free graphs (Q2384395) (← links)
- Strong edge-colorings of sparse graphs with large maximum degree (Q2408965) (← links)
- Strong edge-coloring for jellyfish graphs (Q2515576) (← links)
- Sharp upper bounds on the \(k\)-independence number in graphs with given minimum and maximum degree (Q2657095) (← links)
- Hypergraph incidence coloring (Q2689485) (← links)
- (Q2857388) (← links)
- A Stronger Bound for the Strong Chromatic Index (Q4601050) (← links)
- Strong Chromatic Index of 2-Degenerate Graphs (Q4920654) (← links)
- Distance Colouring Without One Cycle Length (Q4962592) (← links)
- Recent progress on strong edge-coloring of graphs (Q5242836) (← links)
- The Distance-<i>t</i> Chromatic Index of Graphs (Q5414148) (← links)
- The optimal bound on the 3-independence number obtainable from a polynomial-type method (Q6041879) (← links)
- The strong clique index of a graph with forbidden cycles (Q6056786) (← links)
