Skip to search formSkip to main contentSkip to account menu

Claw-free permutation

Known as: Claw (cryptography), Claw-free 
In mathematical and computer science field of cryptography, a group of three numbers (x,y,z) is said to be a claw of two permutations f0 and f1 if f0… 
Wikipedia (opens in a new tab)

Related topics

Related topics

5 relations
Collision resistanceCommitment schemeComputer scienceCryptographic hash function

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Set Graphs. V. On representing graphs as membership digraphs
An undirected graph is commonly represented as a set of vertices and a set of doubletons of vertices; but one can also represent… 
2010
2010
On Independent Vertex Sets in Subclasses of Apple-Free Graphs
In a finite undirected graph, an apple consists of a chordless cycle of length at least 4, and an additional vertex which is not… 
2008
2008
On a cycle partition problem
2007
2007
Vertex 3-colorability of Claw-free Graphs
The 3-COLORABILITY problem is NP-complete in the class of claw-free graphs. In this paper we study the computational complexity… 
2005
2005
Hamiltonian N2‐locally connected claw‐free graphs
A graph G is N2‐locally connected if for every vertex ν in G, the edges not incident with ν but having at least one end adjacent… 
2004
2004
Hamiltonian Connected Claw-Free Graphs
Abstract.A well-known result by O. Ore is that every graph of order n with d(u)+d(v)≥n+1 for any pair of nonadjacent vertices u… 
2003
2003
Independence and upper irredundance in claw-free graphs
1997
1997
Factor-criticality and matching extension in DCT-graphs
The class of DCT-graphs is a common generalization of the classes of almost claw-free and quasi claw-free graphs. We prove that… 
1995
1995
Vertex disjoint cycles for star free graphs
A graph is claw-free if it does not contain K I ,3 as an induced subgraph. A graph is KI,r-free if it does not contain KI,r as an… 
1993
1993
Which Claw-Free Graphs are Perfectly Orderable?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)