Constructing and Classifying Neighborhood Anti-Sperner Graphs

Discrete Mathematics - Netherlands
doi 10.1016/j.disc.2007.10.005
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Displaying Image Neighborhood Hypergraphs Line-Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

On Constructing Some Strongly Well-Covered Graphs

1991English

Hamiltonian Properties of Graphs With Large Neighborhood Unions

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
1991English

Long Dominating Cycles and Paths in Graphs With Large Neighborhood Unions

Journal of Graph Theory
GeometryTopology
1991English

A Survey of Techniques for Constructing Chinese Knowledge Graphs and Their Applications

Sustainability
DevelopmentManagementMonitoringEnvironmental ScienceRenewable EnergyEnergy EngineeringLawSustainabilityPlanningPolicyPower Technologythe EnvironmentGeography
2018English

Constructing Arbitrarily Large Graphs With a Specified Number of Hamiltonian Cycles

Electronic Journal of Graph Theory and Applications
CombinatoricsApplied MathematicsDiscrete Mathematics
2016English

Efficient Parallel and Out of Core Algorithms for Constructing Large Bi-Directed De Bruijn Graphs

BMC Bioinformatics
BiochemistryApplied MathematicsComputer Science ApplicationsStructural BiologyMolecular Biology
2010English

On the Anti-Kekulé Problem of Cubic Graphs

The Art of Discrete and Applied Mathematics
2018English

Sperner Property and Finite-Dimensional Gorenstein Algebras Associated to Matroids

Journal of Commutative Algebra
Number TheoryAlgebra
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy