Maximum cardinality neighbourly sets in quadrilateral free graphs

DOI10.1007/s10878-015-9972-9zbMath1388.90117arXiv1412.8338OpenAlexW3106104785MaRDI QIDQ511689

K. S. Neethi, Sanjeev Saxena

Publication date: 22 February 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1412.8338

zbMATH Keywords

algorithmantimatchinggraphs without \(C_4\)neighbourly setsquadrilateral free graphsstrong edge colouring

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proof of a conjecture on the spectral radius of \(C_4\)-free graphs
• Finding and counting given length cycles
• Extremal graphs without 4-cycles
• The maximum spectral radius of \(C_4\)-free graphs of given order and size
• Induced matchings
• An extremal characterization of the incidence graphs of projective planes
• On the computational complexity of strong edge coloring
• Graphs without quadrilaterals
• On the number of edges of quadrilateral-free graphs
• Total colorings of degenerate graphs
• Über ein Problem von K. Zarankiewicz
• Large Subgraphs without Short Cycles
• Arboricity and Subgraph Listing Algorithms
• Graphs without four-cycles
• Finding a Minimum Circuit in a Graph
• The History of Degenerate (Bipartite) Extremal Graph Problems
• On Graphs that do not Contain a Thomsen Graph

This page was built for publication: Maximum cardinality neighbourly sets in quadrilateral free graphs