Pages that link to "Item:Q2375854"
From MaRDI portal
The following pages link to Proper connection with many colors (Q2375854):
Displaying 29 items.
- Characterizations of graphs having large proper connection numbers (Q274703) (← links)
- Note on vertex and total proper connection numbers (Q334117) (← links)
- Proper connection of graphs (Q442366) (← links)
- Proper connection numbers of complementary graphs (Q723592) (← links)
- Proper connection number of random graphs (Q897901) (← links)
- Coloring graphs to produce properly colored walks (Q1684944) (← links)
- Properly colored trails, paths, and bridges (Q1702827) (← links)
- The \(k\)-proper index of graphs (Q1734744) (← links)
- Proper distance in edge-colored hypercubes (Q1740062) (← links)
- Proper disconnection of graphs (Q2045273) (← links)
- On connectivities of edge-colored graphs (Q2104926) (← links)
- Optimal proper connection of graphs (Q2192984) (← links)
- The optimal proper connection number of a graph with given independence number (Q2234746) (← links)
- Extremal stretch of proper-walk coloring of graphs (Q2243237) (← links)
- On the total proper connection of graphs (Q2272614) (← links)
- The proper diameter of a graph (Q2282468) (← links)
- On strong proper connection number of cubic graphs (Q2312653) (← links)
- On two conjectures about the proper connection number of graphs (Q2359964) (← links)
- Proper connection and size of graphs (Q2401802) (← links)
- Proper connection of direct products (Q2409790) (← links)
- Upper bounds of proper connection number of graphs (Q2410035) (← links)
- Proper rainbow connection number of graphs (Q2656335) (← links)
- Chromatic-connection in graphs (Q2799855) (← links)
- On proper-path colorings in graphs (Q2829346) (← links)
- On Graphs with Proper Connection Number 2 (Q3380403) (← links)
- On the (di)graphs with (directed) proper connection number two (Q5918844) (← links)
- On the (di)graphs with (directed) proper connection number two (Q5920180) (← links)
- Proper‐walk connection number of graphs (Q6055386) (← links)
- The fine-grained complexity of approximately counting proper connected colorings (extended abstract) (Q6606223) (← links)
