Pages that link to "Item:Q4137200"
From MaRDI portal
The following pages link to On Planar Graphical Degree Sequences (Q4137200):
Displaying 20 items.
- On the discrepancy between two Zagreb indices (Q724879) (← links)
- An algorithm for the characterization of the nonplanarity of a maximal graphical partition (Q1095148) (← links)
- Lower bounds on the cardinality of the maximum matchings of planar graphs (Q1135291) (← links)
- Subgraphs and their degree sequences of a digraph (Q1148915) (← links)
- An unresolved conjecture on nonmaximal planar graphical sequences (Q1152376) (← links)
- Bounds on the number of cycles of length three in a planar graph (Q1163566) (← links)
- The splittance of a graph (Q1167741) (← links)
- On the existence and connectivity of a class of maximal planar graphs (Q1168337) (← links)
- Characterization of optimal key set protocols (Q1408828) (← links)
- Planar bipartite biregular degree sequences (Q1625803) (← links)
- On existence of hypergraphs with prescribed edge degree profile (Q1903722) (← links)
- Relaxed and approximate graph realizations (Q2115836) (← links)
- The structure matrix of the class of \(r\)-multigraphs with a prescribed degree sequence (Q2365681) (← links)
- Extremal \(H\)-free planar graphs (Q2415071) (← links)
- A Characterization of the degree sequences of 2-trees (Q3522846) (← links)
- Graphs and degree sequences. I (Q3803156) (← links)
- (Q5855586) (← links)
- On the maximum number of edges in planar graphs of bounded degree and matching number (Q6041557) (← links)
- Constructing certain families of 3‐polytopal graphs (Q6046684) (← links)
- Graph realizations: maximum degree in vertex neighborhoods (Q6098074) (← links)
