Pages that link to "Item:Q2267844"

The following pages link to Chromatic index of graphs with no cycle with a unique chord (Q2267844):

Displaying 20 items.

• Edge-colouring and total-colouring chordless graphs (Q389214) (← links)
• Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs (Q496654) (← links)
• Two complexity results for the vertex coloring problem (Q505438) (← links)
• Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs (Q521809) (← links)
• Total chromatic number of unichord-free graphs (Q643026) (← links)
• A new characterization of unichord-free graphs (Q891324) (← links)
• Requiring that minimal separators induce complete multipartite subgraphs (Q1692647) (← links)
• Strongly unichord-free graphs (Q1717190) (← links)
• Using SPQR-trees to speed up recognition algorithms based on 2-cutsets (Q1752488) (← links)
• On the chromatic index of join graphs and triangle-free graphs with large maximum degree (Q1752497) (← links)
• The P versus NP-complete dichotomy of some challenging problems in graph theory (Q1759844) (← links)
• The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness (Q2007724) (← links)
• Total tessellation cover: bounds, hardness, and applications (Q2091795) (← links)
• Compositions, decompositions, and conformability for total coloring on power of cycle graphs (Q2091818) (← links)
• Even-power of cycles with many vertices are type 1 total colorable (Q2132416) (← links)
• Complexity-separating graph classes for vertex, edge and total colouring (Q2184678) (← links)
• Complexity separating classes for edge-colouring and total-colouring (Q2391946) (← links)
• New graph classes characterized by weak vertex separators and two-pairs (Q2409764) (← links)
• WHEN ALL MINIMAL VERTEX SEPARATORS INDUCE COMPLETE OR EDGELESS SUBGRAPHS (Q2864857) (← links)
• Characterizing k-chordal unichord-free graphs (Q4577849) (← links)