Pages that link to "Item:Q2886306"

The following pages link to A bound of the vertex-distinguishing total chromatic number of graphs (Q2886306):

Displaying 8 items.

• Upper bounds on vertex distinguishing chromatic indices of some Halin graphs (Q377916) (← links)
• Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices (Q458608) (← links)
• Relations of vertex distinguishing total chromatic numbers between a subgraph and its supergraph (Q508738) (← links)
• Upper bounds on the \(D(\beta)\)-vertex-distinguishing total-chromatic number of graphs. (Q2804813) (← links)
• An upper bound for \(D\)(2)-vertex-distinguishing proper edge chromatic numbers of graphs (Q2858198) (← links)
• A bound on vertex distinguishing total coloring of graphs with distance constraint for recurrent event data (Q2885693) (← links)
• The bound of the vertex-distinguishing total chromatic number of regular graphs (Q3180372) (← links)
• (Q3572447) (← links)