A simpler proof for vertex-pancyclicity of squares of connected claw-free graphs (Q442331): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2012.03.042 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C38 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C70 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6064646 / rank
 
Normal rank
Property / zbMATH Keywords
 
claw-free graph
Property / zbMATH Keywords: claw-free graph / rank
 
Normal rank
Property / zbMATH Keywords
 
graph square
Property / zbMATH Keywords: graph square / rank
 
Normal rank
Property / zbMATH Keywords
 
vertex-pancyclicity
Property / zbMATH Keywords: vertex-pancyclicity / rank
 
Normal rank
Property / zbMATH Keywords
 
perfect matching
Property / zbMATH Keywords: perfect matching / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2012.03.042 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1967438624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts / rank
 
Normal rank
Property / cites work
 
Property / cites work: The square of a connected S(K1,3)-free graph is vertex pancyclic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian results inK1,3-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set graphs. I. Hereditarily finite sets and extensional acyclic orientations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost claw‐free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with 1-Factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4074931 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2012.03.042 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:46, 9 December 2024

scientific article
Language Label Description Also known as
English
A simpler proof for vertex-pancyclicity of squares of connected claw-free graphs
scientific article

    Statements

    Identifiers