Pages that link to "Item:Q1313834"
From MaRDI portal
The following pages link to Total colouring regular bipartite graphs is NP-hard (Q1313834):
Displaying 46 items.
- A note on the minimum total coloring of planar graphs (Q326982) (← links)
- Total coloring of certain classes of product graphs (Q327644) (← links)
- The parameterised complexity of list problems on graphs of bounded treewidth (Q342709) (← links)
- Edge-colouring and total-colouring chordless graphs (Q389214) (← links)
- Total chromatic number of generalized Mycielski graphs (Q396736) (← links)
- The total chromatic number of split-indifference graphs (Q442393) (← links)
- Minimum total coloring of planar graph (Q475814) (← links)
- Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs (Q496654) (← links)
- Total coloring of planar graphs without adjacent short cycles (Q512886) (← links)
- Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs (Q521809) (← links)
- The total-chromatic number of some families of snarks (Q536223) (← links)
- Total chromatic number of unichord-free graphs (Q643026) (← links)
- Recent results on the total chromatic number (Q686483) (← links)
- Graph coloring: a novel heuristic based on trailing path-properties, perspective and applications in structured networks (Q780266) (← links)
- On the neighbour-distinguishing index of a graph (Q855303) (← links)
- A result on the total colouring of powers of cycles (Q875593) (← links)
- \([r,s,t]\)-coloring of trees and bipartite graphs (Q960923) (← links)
- Complexity of (p,1)-total labelling (Q967327) (← links)
- On total chromatic number of direct product graphs (Q980443) (← links)
- Total and fractional total colourings of circulant graphs (Q998370) (← links)
- Equitable total coloring of \(C_m\square C_n\) (Q1028450) (← links)
- Graph coloring with cardinality constraints on the neighborhoods (Q1040081) (← links)
- Total colorings of equibipartite graphs (Q1297471) (← links)
- Total coloring of rooted path graphs (Q1708273) (← links)
- Total colorings of product graphs (Q1743686) (← links)
- Total tessellation cover: bounds, hardness, and applications (Q2091795) (← links)
- Compositions, decompositions, and conformability for total coloring on power of cycle graphs (Q2091818) (← links)
- Complexity-separating graph classes for vertex, edge and total colouring (Q2184678) (← links)
- Total coloring conjecture for certain classes of graphs (Q2283827) (← links)
- Complexity separating classes for edge-colouring and total-colouring (Q2391946) (← links)
- On defected colourings of graphs (Q2439252) (← links)
- The hunting of a snark with total chromatic number 5 (Q2448882) (← links)
- On total coloring the direct product of cycles and bipartite direct product of graphs (Q2699911) (← links)
- Total chromatic number of {square,unichord}-free graphs (Q2883635) (← links)
- A decomposition for total-coloring partial-grids and list-total-coloring outerplanar graphs (Q3008921) (← links)
- The total chromatic number of some bipartite graphs (Q3439400) (← links)
- On the total and AVD-total coloring of graphs (Q4956171) (← links)
- Total colorings of circulant graphs (Q5025120) (← links)
- Total coloring of quasi-line graphs and inflated graphs (Q5025132) (← links)
- COLORING ALGORITHMS ON SUBCUBIC GRAPHS (Q5696963) (← links)
- (Q5708488) (← links)
- Total colorings of certain classes of lexicographic product graphs (Q5866032) (← links)
- (Q6150943) (← links)
- Total coloring conjecture on certain classes of product graphs (Q6164667) (← links)
- Total coloring of some graph operations (Q6547840) (← links)
- Equitable total coloring of Fibonacci graphs (Q6583579) (← links)
