Human Skeleton Graph

Author

Eric W. Weisstein
January 25, 2026

This notebook downloaded from https://mathworld.wolfram.com/notebooks/GraphTheory/HumanSkeletonGraph.nb.

For more information, see Eric's MathWorld entry https://mathworld.wolfram.com/HumanSkeletonGraph.html.

©2026 Wolfram Research, Inc. except for portions noted otherwise

Figures

Graph

GraphicsRow[GraphData["HumanSkeletonGraph","Graph","All"]//StyleGraphs[#,VertexSize->{"Scaled",.01}]&,Dividers->All]

Connected components

Length[bones=EntityList[EntityClass["AnatomicalStructure","Bones"]]]

SimpleGraphQ[GraphData["HumanSkeletonGraph"]]

cc=ConnectedGraphComponents[annotatedg=VertexReplace[GraphData["HumanSkeletonGraph","Graph","3D"],Thread[Range[206]->bones]]]

LabelGraph/@Rest[cc]

VertexCount/@cc

VertexList/@Rest[cc]

%/.e_Entity:>CommonName[e]

GraphicsRow[{
Annotate[cc[[2]],{VertexLabels->Automatic,EdgeStyle->StandardRed,VertexStyle->StandardRed}],
Annotate[cc[[3]],{VertexLabels->Automatic,EdgeStyle->StandardYellow,VertexStyle->StandardYellow}],
HighlightGraph[annotatedg,Rest[cc], VertexSize->10,PlotRange->{{-300,300},{-300,300},{1200,2000}},VertexLabels->{(Entity["hyoid bone", Entity["AnatomicalStructure","HyoidBone"], "Entity[\"AnatomicalStructure\", \"HyoidBone\"]", "anatomical structure"])->Automatic}]
}]

Embeddings

<<MathWorld`Graphs`

Names

GraphData["HumanSkeletonGraph","StandardName"]

GraphData["HumanSkeletonGraph","StandardNames"]

HouseOfGraphs

hogid=GraphData["HumanSkeletonGraph","NotationRules","HouseOfGraphs"]

HouseOfGraphsLookup[hogid]

HouseOfGraphsGraph[hogid]//StyleGraphs[#,ImageSize->Small]&

Wikidata

GraphData["HumanSkeletonGraph","WikidataID"]

GraphData["HumanSkeletonGraph","WikidataID","URL"]

Primary

GraphData["HumanSkeletonGraph"]//StyleGraphs[#,ImageSize->Small]&

All

GraphData["HumanSkeletonGraph","Graph","All"]//StyleGraphs[#,VertexSize->{"Scaled",.01}]&

Connected components

GraphData["HumanSkeletonGraph","ConnectedComponents"]

CurvedEdge

GraphData["HumanSkeletonGraph","Graph","CurvedEdge"]//StyleGraphs

Inexact

Select[GraphData["HumanSkeletonGraph","Graph","All"],(!FreeQ[GraphEmbedding[#],_?InexactNumberQ]&)]//StyleGraphs

Degenerate

GraphData["HumanSkeletonGraph","Graph","Degenerate"]//StyleGraphs

DegenerateGraphEmbeddingTypes/@GraphData["HumanSkeletonGraph","Graph","Degenerate"]//Column

Embeddings

GraphDataEmbeddings[GraphData["HumanSkeletonGraph"]]

Default embedding

g0=GraphPlot[Graph[GraphData["HumanSkeletonGraph","VertexList"],GraphData["HumanSkeletonGraph","Edges"]]]

Projection construction

Show[GraphData["HumanSkeletonGraph","Graph","3D"],ViewPoint->{0,0,100},ViewVertical->{0,1,0}]

gz=Graph[GraphData["HumanSkeletonGraph","VertexList"],GraphData["HumanSkeletonGraph","EdgeList"],VertexCoordinates->GraphData["HumanSkeletonGraph","Embeddings","3D"][[All,;;2]]]

Show[GraphData["HumanSkeletonGraph","Graph","3D"],ViewPoint->{0,100,0},ViewVertical->{0,0,1}]

gy=Graph[GraphData["HumanSkeletonGraph","VertexList"],GraphData["HumanSkeletonGraph","EdgeList"],VertexCoordinates->GraphData["HumanSkeletonGraph","Embeddings","3D"][[All,{1,3}]]]

gs={gy,gz}

Perspective

GraphData["HumanSkeletonGraph","Graph","Perspective"]//StyleGraphs[#,VertexSize->{"Scaled",.01}]&

GeneralizedPetersen

GraphData["HumanSkeletonGraph","Graph","GeneralizedPetersen"]//StyleGraphs

IGraph

GraphData["HumanSkeletonGraph","Graph","IGraph"]//StyleGraphs

CompleteKPartite

GraphData["HumanSkeletonGraph","Graph","CompleteKPartite"]//StyleGraphs

Bipartite

GraphData["HumanSkeletonGraph","Bipartite"]

GraphData["HumanSkeletonGraph","Graph","Bipartite"]

Bilateral

GraphData["HumanSkeletonGraph","Graph","Bilateral"]//StyleGraphs

Grid[DeleteCases[Monitor[{g=#,BilateralGraphEmbeddingTypes[#],GraphSymmetryGroup[#]}&/@GraphData["HumanSkeletonGraph","Graph","All"],g],{_,_,TransformationGroup[{}]}],Dividers->All,Alignment->{{Center,{Left}}}]//Quiet

Circular

GraphData["HumanSkeletonGraph","Graph","Circular"]//StyleGraphs

Circular construction All

GraphData["HumanSkeletonGraph","Hamiltonian"]

GraphData["HumanSkeletonGraph","LCF"]

GraphData["HumanSkeletonGraph","HamiltonianCycleCount"]

Planar

GraphData["HumanSkeletonGraph","Planar"]

GraphData["HumanSkeletonGraph","Graph","Planar"]//StyleGraphs

MinimalCrossingNumber crossings.uos.de [too many vertices]

CrossingNumber[GraphData["HumanSkeletonGraph"],Method->"WebCompute"]//AbsoluteTiming

The graph you entered is too large: 206 nodes (max 100) and 342 edges (max 200). Please contact Markus Chimani if you really need to compute the crossing number of this graph.

DateString[]

MinimalCrossingNumber: "EmbeddingScheme" -> 1

(cn=CrossingNumber[GraphData["HumanSkeletonGraph"],"EmbeddingScheme"->1,TimeConstraint->1])//AbsoluteTiming

(cn=CrossingNumber[GraphData["HumanSkeletonGraph"],"EmbeddingScheme"->1,TimeConstraint->10])//AbsoluteTiming

(cn=CrossingNumber[GraphData["HumanSkeletonGraph"],"EmbeddingScheme"->1,TimeConstraint->60])//AbsoluteTiming

(cn=CrossingNumber[GraphData["HumanSkeletonGraph"],"EmbeddingScheme"->1,TimeConstraint->3600])//AbsoluteTiming

(cn=CrossingNumber[GraphData["HumanSkeletonGraph"],"EmbeddingScheme"->1,TimeConstraint->5 3600])//AbsoluteTiming

(cn=CrossingNumber[GraphData["HumanSkeletonGraph"],"EmbeddingScheme"->1,TimeConstraint->86400])//AbsoluteTiming

MinimalCrossingNumber: "EmbeddingScheme" -> 2

(cn=CrossingNumber[GraphData["HumanSkeletonGraph"],"EmbeddingScheme"->2,TimeConstraint->1])//AbsoluteTiming

(cn=CrossingNumber[GraphData["HumanSkeletonGraph"],"EmbeddingScheme"->2,TimeConstraint->10])//AbsoluteTiming

(cn=CrossingNumber[GraphData["HumanSkeletonGraph"],"EmbeddingScheme"->2,TimeConstraint->60])//AbsoluteTiming

(cn=CrossingNumber[GraphData["HumanSkeletonGraph"],"EmbeddingScheme"->2,TimeConstraint->3600])//AbsoluteTiming

(cn=CrossingNumber[GraphData["HumanSkeletonGraph"],"EmbeddingScheme"->2,TimeConstraint->5 3600])//AbsoluteTiming

(cn=CrossingNumber[GraphData["HumanSkeletonGraph"],"EmbeddingScheme"->2,TimeConstraint->86400])//AbsoluteTiming

MinimalCrossingNumber: "EmbeddingScheme" -> 3

(cn=CrossingNumber[GraphData["HumanSkeletonGraph"],"EmbeddingScheme"->3,TimeConstraint->1])//AbsoluteTiming

(cn=CrossingNumber[GraphData["HumanSkeletonGraph"],"EmbeddingScheme"->3,TimeConstraint->10])//AbsoluteTiming

(cn=CrossingNumber[GraphData["HumanSkeletonGraph"],"EmbeddingScheme"->3,TimeConstraint->60])//AbsoluteTiming

(cn=CrossingNumber[GraphData["HumanSkeletonGraph"],"EmbeddingScheme"->3,TimeConstraint->3600])//AbsoluteTiming

(cn=CrossingNumber[GraphData["HumanSkeletonGraph"],"EmbeddingScheme"->3,TimeConstraint->5 3600])//AbsoluteTiming

(cn=CrossingNumber[GraphData["HumanSkeletonGraph"],"EmbeddingScheme"->3,TimeConstraint->86400])//AbsoluteTiming

Quit

MinimalCrossing

GraphData["HumanSkeletonGraph","CN"]

(gs=GraphData["HumanSkeletonGraph","Graph","MinimalCrossing"])//StyleGraphs

GraphCrossingCount/@gs

GraphCrossingDiagram/@gs

MinimalRectilinearCrossing

GraphData["HumanSkeletonGraph","RCN"]

GraphData["HumanSkeletonGraph","Graph","MinimalRectilinearCrossing"]//StyleGraphs

MinimalRectilinearCrossing construction order X [minimum RCN == ]

Length[gs=FindMinimalRectilinearCrossingGraph[GraphData["HumanSkeletonGraph"],Automatic,All,"Size"->Automatic,Method->"SubgraphIsomorphism",Debug->True]]//Timing

MaxMemoryUsed[]/10^9. GB

Tally[RectilinearCrossingCount/@gs]//Timing

Tally[RectilinearLocalCrossingCount/@gs]//Timing

GraphSymmetryGroup/@gs//Tally

Select[gs,GraphSymmetryGroup[#]=!=TransformationGroup[{}]&]

Take[gs,UpTo[100]]

MinimalRectilinearCrossing construction order X [minimum RCN == ]

Length[gs=FindMinimalRectilinearCrossingGraph[GraphData["HumanSkeletonGraph"],Automatic,All,"Size"->XXX,Method->"SubgraphIsomorphism",Debug->True]]//Timing

MaxMemoryUsed[]/10^9. GB

Tally[RectilinearCrossingCount/@gs]//Timing

Tally[RectilinearLocalCrossingCount/@gs]//Timing

GraphSymmetryGroup/@gs//Tally

Select[gs,GraphSymmetryGroup[#]=!=TransformationGroup[{}]&]

Take[gs,UpTo[100]]

MinimalCrossing construction Tutte

(cn=CrossingNumber[GraphData["HumanSkeletonGraph"],TimeConstraint->1])//AbsoluteTiming

(g=MinimalCrossingGraph[GraphData["HumanSkeletonGraph"],"CrossingNumber"->cn])//PolyhedralGraphQ//AbsoluteTiming

faces=ReverseSort@SymmetricallyDistinctFaces[g]

Tally[ReverseSort[Length/@faces]]

TutteGraphs=BilateralGraph[CenterGraph@IGLayoutTutte[g,"OuterFace"->#],"ReturnNonbilateralGraph"->True]&/@faces

TutteGraphsWithOuterCrossingPointCounts={
#,
Count[OuterFace[#],_?(GreaterThan[GraphData["HumanSkeletonGraph","V"]])]
}&/@TutteGraphs;

Cases[TutteGraphsWithOuterCrossingPointCounts,{g_,0}:>g]

Cases[TutteGraphsWithOuterCrossingPointCounts,{g_,1}:>g]

LocalCrossingNumberWithEmbeddings=
{1+Max[Length/@DeleteCases[
Drop[AdjacencyList[#],GraphData["HumanSkeletonGraph","V"]],
_Integer?(LessEqualThan[GraphData["HumanSkeletonGraph","V"]]),
{2}
]],#}&/@TutteGraphs

TutteGraphsWithSymmetryGroups={
#,
GraphSymmetryGroup[
#,
AdditionalData->Join[Table[True,GraphData["HumanSkeletonGraph","V"]],Table[False,cn]],
SameTest->Equal
]
}&/@TutteGraphs;

SymmetricEmbeddingsWithOrientations=DeleteCases[
TutteGraphsWithSymmetryGroups,
{_,TransformationGroup[{}]}
]

Select[SymmetricEmbeddingsWithOrientations[[All,1]],Count[OuterFace[#],_?(GreaterThan[GraphData["HumanSkeletonGraph","V"]])]==0&]

MinimalCrossing construction Random 1k

(cn=CrossingNumber[GraphData["HumanSkeletonGraph"],TimeConstraint->1])//AbsoluteTiming

(RandomGraphs=Table[MinimalCrossingGraph[GraphData["HumanSkeletonGraph"],"CrossingNumber"->cn,RandomSeed->n],{n,1000}]//Union);//Timing

RandomGraphsWithOuterCrossingPointCounts={
#,
Count[OuterFace[#],_?(GreaterThan[GraphData["HumanSkeletonGraph","V"]])]
}&/@RandomGraphs;

Small numbers of crossing points on the boundary:

Cases[RandomGraphsWithOuterCrossingPointCounts,{g_,0}:>g]

Cases[RandomGraphsWithOuterCrossingPointCounts,{g_,1}:>g]

Symmetric embeddings:

RandomGraphsWithSymmetryGroups={
#,
GraphSymmetryGroup[
#,
AdditionalData->Join[Table[True,GraphData["HumanSkeletonGraph","V"]],Table[False,cn]],
SameTest->Equal
]
}&/@RandomGraphs;

MaxMemoryUsed[]/10^9.GB

DeleteCases[
RandomGraphsWithSymmetryGroups,
{_,TransformationGroup[{}]}
]/.g_Graph:>BilateralGraph[CenterGraph@g,"ReturnNonbilateralGraph"->True]

MinimalCrossing construction Random 20k

(cn=CrossingNumber[GraphData["HumanSkeletonGraph"],TimeConstraint->1])//AbsoluteTiming

(RandomGraphs=Table[MinimalCrossingGraph[GraphData["HumanSkeletonGraph"],"CrossingNumber"->cn,RandomSeed->n],{n,20000}]//Union);//Timing

RandomGraphsWithOuterCrossingPointCounts={
#,
Count[OuterFace[#],_?(GreaterThan[GraphData["HumanSkeletonGraph","V"]])]
}&/@RandomGraphs;

Small numbers of crossing points on the boundary:

Cases[RandomGraphsWithOuterCrossingPointCounts,{g_,0}:>g]

Cases[RandomGraphsWithOuterCrossingPointCounts,{g_,1}:>g]

Symmetric embeddings:

RandomGraphsWithSymmetryGroups={
#,
GraphSymmetryGroup[
#,
AdditionalData->Join[Table[True,GraphData["HumanSkeletonGraph","V"]],Table[False,cn]],
SameTest->Equal
]
}&/@RandomGraphs;

MaxMemoryUsed[]/10^9.GB

DeleteCases[
RandomGraphsWithSymmetryGroups,
{_,TransformationGroup[{}]}
]/.g_Graph:>BilateralGraph[CenterGraph@g,"ReturnNonbilateralGraph"->True]

MinimalLocalCrossing

GraphData["HumanSkeletonGraph",{"LocalCrossingNumber","RectilinearLocalCrossingNumber"}]

GraphData["HumanSkeletonGraph","Graph","MinimalLocalCrossing"]//StyleGraphs

MinimalRectilinearLocalCrossing

GraphData["HumanSkeletonGraph",{"LocalCrossingNumber","RectilinearLocalCrossingNumber"}]

GraphData["HumanSkeletonGraph","Graph","MinimalRectilinearLocalCrossing"]//StyleGraphs

MinimaRectilinearlLocalCrossing construction 1000

AdjacentCrossingsQ[g_Graph,cn_Integer]:=Module[{a=AdjacencyList[g],n=VertexCount[g]-cn},Max[Take[a,-cn]]>n]

(cn=CrossingNumber[GraphData["HumanSkeletonGraph"],TimeConstraint->10])//AbsoluteTiming

(gs=Select[Table[MinimalCrossingGraph[GraphData["HumanSkeletonGraph"],"CrossingNumber"->cn,RandomSeed->i],{i,1000}],!AdjacentCrossingsQ[#,cn]&]//Union)//Timing

MinimaRectilinearlLocalCrossing construction 20000

AdjacentCrossingsQ[g_Graph,cn_Integer]:=Module[{a=AdjacencyList[g],n=VertexCount[g]-cn},Max[Take[a,-cn]]>n]

(cn=CrossingNumber[GraphData["HumanSkeletonGraph"],TimeConstraint->10])//AbsoluteTiming

(gs=Select[Table[MinimalCrossingGraph[GraphData["HumanSkeletonGraph"],"CrossingNumber"->cn,RandomSeed->i],{i,20000}],!AdjacentCrossingsQ[#,cn]&]//Union)//Timing

Circulant

GraphData["HumanSkeletonGraph","Circulant"]

GraphData["HumanSkeletonGraph","Graph","Circulant"]//StyleGraphs

Circulant construction

GraphData["HumanSkeletonGraph","NotationRules","Circulant"]

(ci=CirculantIndices[GraphData["HumanSkeletonGraph"]])//Timing

CirculantGraph1@@@ci

Cases[GraphData["HumanSkeletonGraph","StandardNames"],{"Circulant",i_}:>i]

CirculantGraph1@@@%

Complement graph

compl=GraphData["HumanSkeletonGraph","ComplementGraph","Name"]

Line graph

GraphData["HumanSkeletonGraph","Line"]

LineGraphQ[GraphData["HumanSkeletonGraph"]]//Timing

RootGraph

roots=Select[GraphData[All],GraphData[#,"LineGraph","Name"]==="HumanSkeletonGraph"&]

RootGraph[GraphData["HumanSkeletonGraph"]]

Halin

GraphData["HumanSkeletonGraph","Halin"]

GraphData["HumanSkeletonGraph","Graph","Halin"]//StyleGraphs

Rigid

GraphData["HumanSkeletonGraph","Rigid"]

GraphData["HumanSkeletonGraph","Graph","Rigid"]//StyleGraphs

Flexible

GraphData["HumanSkeletonGraph","Flexible"]

GraphData["HumanSkeletonGraph","Graph","Flexible"]//StyleGraphs

LCF

GraphData["HumanSkeletonGraph","LCF"]

GraphData["HumanSkeletonGraph","HamiltonianCycleCount"]

GraphData["HumanSkeletonGraph","LCFSignature"]

GraphData["HumanSkeletonGraph","LCFNotations"]

GraphData["HumanSkeletonGraph","Graph","LCF"]//StyleGraphs

Tally[LCFNotation[#][[2]]&/@%]

UnitDistance

GraphData["HumanSkeletonGraph","UnitDistance"]

UnitDistanceGraphQ[GraphData["HumanSkeletonGraph"],Debug->True]//Timing

GraphData["HumanSkeletonGraph","Graph","UnitDistance"]//StyleGraphs

UnitDistance by refinement of default embeddings

Graph[edge list]

(g=UnitDistanceEmbeddingRefine[Graph[GraphData["HumanSkeletonGraph","EdgeList"]],MaxIterations->500])//Timing

UnitDistanceGraphEmbeddingQ[g]

Graph[vertex list, edge list]

(g=UnitDistanceEmbeddingRefine[Graph[GraphData["HumanSkeletonGraph","VertexList"],GraphData["HumanSkeletonGraph","EdgeList"]],MaxIterations->500])//Timing

UnitDistanceGraphEmbeddingQ[g]

UnitDistance by refinement of existing embeddings

gs=UnitDistanceEmbeddingRefine[#,MaxIterations->500]&/@Complement@@(GraphData["HumanSkeletonGraph","Graph",#]&/@{"All","UnitDistance"})

TextGrid[
gdata=SortBy[
{#,DegenerateGraphEmbeddingQ[#],GraphSymmetryGroup[#],Max[Abs[EdgeLengths[#]-1]]}&/@gs,
Last
],
Dividers->All
]

Cases[gdata,{__,0.}]

Symmetric:

gs=Cases[
gdata,
{g_,_,sym:Except[TransformationGroup[{}]],diff_}:>{
HighlightGraph[g1=BilateralGraph[CenterGraph[g],"ReturnNonbilateralGraph"->True],Flatten[FindCoincidentVertices[g1]]],
sym,
diff
}]

UnitDistance by FindUnitDistanceEmbedding  (random embeddings returning on messages)

gs=FindUnitDistanceEmbedding[GraphData["HumanSkeletonGraph"],50,"ReturnWithMessage"->True];//Quiet//Timing

gdata=SortBy[
{#,Max[Abs[EdgeLengths[#]-1]]}&/@gs,
Last
]

Cases[gdata,{g_?UnitDistanceGraphEmbeddingQ,_}:>g]

SymmetricEmebddings=Select[gdata,GraphSymmetryGroup[#[[1]]]=!=TransformationGroup[{}]&]

UnitDistance by FindUnitDistanceEmbedding  (random embedding waiting until UD is found)

FindUnitDistanceEmbedding[GraphData["HumanSkeletonGraph"],"ReturnWithMessage"->False]//Quiet//Timing

Matchstick

GraphData["HumanSkeletonGraph","Matchstick"]

GraphData["HumanSkeletonGraph","Graph","Matchstick"]//StyleGraphs

3D default

Graph3D[GraphData["HumanSkeletonGraph","Edges"]]

3D construction

[see Construction section below]

3D All

GraphData["HumanSkeletonGraph","Graph",{"3D","All"}]

3D UnitDistance construction Random

GraphData["HumanSkeletonGraph","Dimension"]

(g=UnitDistanceEmbeddingRefine[
Graph3D[
GraphData["HumanSkeletonGraph","VertexList"],
GraphData["HumanSkeletonGraph","EdgeList"]
],
WorkingPrecision->25])//Timing

EdgeLengths[g]

UnitDistanceGraphEmbeddingQ[g]

3D UnitDistance

GraphData["HumanSkeletonGraph","Graph",{"3D","UnitDistance"}]

3D Polyhedron

GraphData["HumanSkeletonGraph","Polyhedral"]

GraphData["HumanSkeletonGraph","Graph",{"3D","Polyhedron"}]

Properties

ConnectedComponentCount

GraphData["HumanSkeletonGraph","ConnectedComponentCount"]

ConnectedComponents

Length[bones=EntityList[EntityClass["AnatomicalStructure","Bones"]]]

SimpleGraphQ[GraphData["HumanSkeletonGraph"]]

cc=ConnectedGraphComponents[annotatedg=VertexReplace[GraphData["HumanSkeletonGraph","Graph","3D"],Thread[Range[206]->bones]]]

LabelGraph/@Rest[cc]

VertexCount/@cc

EdgeCount

GraphData["HumanSkeletonGraph","EdgeCount"]

VertexCount

GraphData["HumanSkeletonGraph","VertexCount"]

Construction

Length[bones=EntityList[EntityClass["AnatomicalStructure","Bones"]]]

Cases[
EntityValue[bones,{"CanonicalName","BoneArticulation"}],{_,_Missing}
]

Length[connectivity=EntityValue[EntityClass["AnatomicalStructure", "Bones"],"BoneArticulation"]/.{_Missing->{}}]

Length[connectivity]

Position[EntityValue[bones,"RegionCentroid"],_?(Length[#]!=3&),1,Heads->False]

bones[[3]]

vertices=EntityValue[bones,"RegionCentroid"]/._Missing:>{-0.654145,-9.26174,802.713};

vertices[[3]]

Graphics3D[{Point[vertices],Red,Point[vertices[[3]]]},Axes->True]

directededges=Flatten[Thread/@Transpose[{bones,connectivity}],1];

undirectededges=Union[Sort/@directededges];

HumanSkeletonGraph=Graph[bones,UndirectedEdge@@@undirectededges,VertexCoordinates->vertices,VertexStyle->Blue,VertexSize->{"Scaled",.02}]

Through[{VertexCount,EdgeCount}[HumanSkeletonGraph]]

cc=ConnectedGraphComponents[HumanSkeletonGraph]

VertexCount/@cc

VertexList[cc[[-1]]]

EdgeList/@Rest[cc]

GraphData

GraphDataClassString

GraphDataClassString["HumanSkeletonGraph"]

GraphDataString

<<MathWorld`Graphs`

HumanSkeletonGraph=;

file=OpenWrite["~/human-skeleton.m"]

WriteString[
file,
GraphDataString[
HumanSkeletonGraph,
"StandardName"->"HumanSkeletonGraph",
"Name"->"human skeleton graph",
"Information"->"HumanSkeletonGraph",
"Skip"->{"ABCEnergy","ABCIndex","ABCSpectralRadius","Anarboricity","Arboricity","ArithmeticGeometricEnergy","ArithmeticGeometricSpectralRadius","BroadcastTime","BroadcastTimes","ConstructionNumber","ConnectedInducedSubgraphPolynomial","Cycles","CyclicEdgeConnectivity","DominatingSets","EdgeChromaticNumber","EigenvectorCentralities","HamiltonConnected","HamiltonianCycles","HamiltonianWalks","HITSCentralities","IdiosyncraticPolynomial","IndependentEdgeSets","IndependentVertexSets","IntersectionNumber","IrredundancePolynomial","LinklesslyEmbeddable","LongestCycle","LongestCycles","LowerIndependenceNumber","LowerMatchingNumber","MatchingGeneratingPolynomial","MaximalIndependentEdgeSet","MaximalIndependentEdgeSets","MaximumIndependentEdgeSet","MaximumIndependentEdgeSetCount","MaximumIndependentEdgeSets","MaximumIndependentVertexSets","MaximumIrredundantSet","MetricDimension","MinimumConnectedDominatingSets","MinimumCyclicEdgeCuts","MinimumDominatingSets","MinimumEdgeColoring","MinimumTotalDominatingSets","MinimumVertexColorings","MinimumWeightFractionalColoring","Minors","Pancyclic","PathPolynomial","ProjectivePlanar","QuadraticEmbeddingConstant","RandicEnergy","SomborIndex","Thickness","TotalDominationPolynomial","TuttePolynomial","UniquelyHamiltonian","VisibilityPolynomial"},
TimeConstraint->10]
]

Close[file]