The following pages link to (Q5502080):
Displaying 17 items.
- On the total coloring of generalized Petersen graphs (Q271609) (← links)
- Total-colorings of complete multipartite graphs using amalgamations (Q271641) (← links)
- On the equitable total chromatic number of cubic graphs (Q298960) (← links)
- A new text information extraction algorithm of video image under multimedia environment (Q2321691) (← links)
- An optimization detection algorithm for complex intrusion interference signal in mobile wireless network (Q2321705) (← links)
- On type 2 snarks and dot products (Q2413173) (← links)
- The hunting of a snark with total chromatic number 5 (Q2448882) (← links)
- Total coloring and total matching: polyhedra and facets (Q2673562) (← links)
- On coloring problems of snark families (Q2840681) (← links)
- Covering cubic graphs with matchings of large size (Q2848743) (← links)
- On total coloring of snark products (Q2918472) (← links)
- Snarks with given real flow numbers (Q3096956) (← links)
- Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44 (Q5225040) (← links)
- On total coloring and equitable total coloring of infinite snark families (Q6140969) (← links)
- A note for the SNIEP in size 5 (Q6168560) (← links)
- Reducible 3-critical graphs (Q6181220) (← links)
- Rotationally symmetric snarks from voltage graphs (Q6197742) (← links)