Pages that link to "Item:Q5587729"
From MaRDI portal
The following pages link to SOME UNSOLVED PROBLEMS IN GRAPH THEORY (Q5587729):
Displaying 50 items.
- On the total coloring of generalized Petersen graphs (Q271609) (← links)
- Total coloring of planar graphs without short cycles (Q281812) (← links)
- Graph products of the trivariate total domination polynomial and related polynomials (Q298962) (← links)
- A note on the minimum total coloring of planar graphs (Q326982) (← links)
- Total coloring of certain classes of product graphs (Q327644) (← links)
- On the total choosability of planar graphs and of sparse graphs (Q407575) (← links)
- The \((p,q)\)-total labeling problem for trees (Q408175) (← links)
- On edge colorings of 1-planar graphs without adjacent triangles (Q413262) (← links)
- (\( \Delta + 1\))-total choosability of planar graphs with no cycles of length from 4 to \(k\) and without close triangles (Q432709) (← links)
- The adjacent vertex distinguishing total chromatic number (Q442409) (← links)
- A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs (Q450562) (← links)
- Asymptotically optimal induced universal graphs (Q521601) (← links)
- The total chromatic number of graphs having large maximum degree (Q686156) (← links)
- An upper bound for total colouring of graphs (Q686500) (← links)
- The chromatic index of graphs with large maximum degree (Q786820) (← links)
- Recognizing Cartesian products in linear time (Q864136) (← links)
- Finding the exact bound of the maximum degrees of class two graphs embeddable in a surface of characteristic \(\epsilon \in \{-1, -2, -3\}\) (Q933675) (← links)
- Total coloring of planar graphs of maximum degree eight (Q991795) (← links)
- On the size of edge-coloring critical graphs with maximum degree 4 (Q998479) (← links)
- The total chromatic number of regular graphs of high degree (Q1042999) (← links)
- Total colorings of planar graphs with maximum degree at least 8 (Q1043002) (← links)
- On graphs critical with respect to edge-colourings (Q1164055) (← links)
- On critical graphs with chromatic index 4 (Q1214435) (← links)
- The total coloring of a multigraph with maximal degree 4 (Q1259607) (← links)
- Total chromatic number of graphs of odd order and high degree (Q1301827) (← links)
- Recent developments in total colouring (Q1322273) (← links)
- Extending fixed vertex-colourings to total colourings (Q1377889) (← links)
- The total chromatic number of graphs of even order and high degree (Q1408886) (← links)
- An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree (Q1408892) (← links)
- Total coloring of outer-1-planar graphs with near-independent crossings (Q1680477) (← links)
- Laplacian distribution and domination (Q1684945) (← links)
- Total coloring of rooted path graphs (Q1708273) (← links)
- A note on asymptotically optimal neighbour sum distinguishing colourings (Q1715623) (← links)
- On edge colorings of 1-planar graphs without 5-cycles with two chords (Q1717181) (← links)
- Graph edge coloring: a survey (Q1733850) (← links)
- Total colorings of product graphs (Q1743686) (← links)
- Total equitable list coloring (Q1756126) (← links)
- A new upper bound for total colourings of graphs (Q1842182) (← links)
- Generalization of two results of Hilton on total-colourings of a graph (Q1893175) (← links)
- Total chromatic number of regular graphs of odd order and high degree (Q1918537) (← links)
- Improving the Clark-Suen bound on the domination number of the Cartesian product of graphs (Q2012524) (← links)
- The edge colorings of \(K_5\)-minor free graphs (Q2022144) (← links)
- Italian domination in the Cartesian product of paths (Q2025085) (← links)
- A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable (Q2030446) (← links)
- Tightness of domination inequalities for direct product graphs (Q2037578) (← links)
- Total coloring of outer-1-planar graphs: the cold case (Q2039699) (← links)
- On list equitable total colorings of the generalized theta graph (Q2042636) (← links)
- 3-tuple total domination number of Rook's graphs (Q2062669) (← links)
- Equitable total chromatic number of \(K_{r \times p}\) for \(p\) even (Q2132407) (← links)
- Total coloring of claw-free planar graphs (Q2151210) (← links)
