Pages that link to "Item:Q4111599"
From MaRDI portal
The following pages link to Asymmetric trees with two prescribed degrees (Q4111599):
Displaying 36 items.
- Number of distinguishing colorings and partitions (Q776312) (← links)
- On digraphs with circulant adjacent matrices (Q1123205) (← links)
- Asymmetrising sets in trees (Q1191926) (← links)
- Asymmetrization of infinite trees (Q1191927) (← links)
- On a theorem of Halin (Q1688265) (← links)
- On circulant digraphs with regular automorphism groups (Q1920446) (← links)
- Distinguishing index of maps (Q2011148) (← links)
- Asymmetric colorings of products of graphs and digraphs (Q2026319) (← links)
- Symmetry parameters for Mycielskian graphs (Q2073195) (← links)
- Proper distinguishing arc-colourings of symmetric digraphs (Q2079126) (← links)
- Distinguishing number of universal homogeneous Urysohn metric spaces (Q2088703) (← links)
- Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed (Q2153303) (← links)
- Asymmetrizing trees of maximum valence \(2^{\aleph_0}\) (Q2189429) (← links)
- A bound for the distinguishing index of regular graphs (Q2198979) (← links)
- Distinguishing graphs of maximum valence 3 (Q2278113) (← links)
- Two sufficient conditions for non-normal Cayley graphs and their applications (Q2372516) (← links)
- Asymmetric edge-colorings of graphs with three colors (Q2674556) (← links)
- On isomorphisms of connected Cayley graphs, III (Q4216665) (← links)
- The finite simple groups with at most two fusion classes of every order (Q4338183) (← links)
- Groups with a Cayley graph isomorphic to a hypercube (Q4354638) (← links)
- On finite groups with the Cayley invariant property (Q4374807) (← links)
- The finite groups with the 2-dci property (Q4880102) (← links)
- Coarse distinguishability of graphs with symmetric growth (Q5013344) (← links)
- Finite and infinite vertex-transitive cubic graphs and their distinguishing cost and density (Q5045282) (← links)
- Distinguishing arc-colourings of symmetric digraphs (Q5058208) (← links)
- Number of colors needed to break symmetries of a graph by an arbitrary edge coloring (Q5058213) (← links)
- Distinguishing Generalized Mycielskian Graphs (Q5090527) (← links)
- The role of the Axiom of Choice in proper and distinguishing colourings (Q5881017) (← links)
- Distinguishing threshold of graphs (Q6074586) (← links)
- Distinguishing infinite graphs with bounded degrees (Q6081887) (← links)
- Asymmetric colouring of locally compact permutation groups (Q6096835) (← links)
- The distinguishing index of graphs with infinite minimum degree (Q6142658) (← links)
- The number of distinguishing colorings of a Cartesian product graph (Q6558479) (← links)
- Edge-locating coloring of graphs (Q6571562) (← links)
- Distinguishing colorings, proper colorings, and covering properties without \textsf{AC} (Q6619401) (← links)
- Breaking small automorphisms by list colourings (Q6657594) (← links)
